Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Bernard Immanuel
Universitas Indonesia
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Orthogonal labeling Bernard Immanuel; Kiki A. Sugeng
Indonesian Journal of Combinatorics Vol 1, No 1 (2016)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (218.824 KB) | DOI: 10.19184/ijc.2016.1.1.1

Abstract

Let ∆G be the maximum degree of a simple connected graph G(V,E). An injective mapping P : V → R∆G is said to be an orthogonal labeling of G if uv,uw ∈ E implying (P(v) − P(u)) · (P(w) − P(u)) = 0, where · is the usual dot product defined in Euclidean space. A graph G which has an orthogonal labeling is called an orthogonal graph. This labeling is motivated by the existence of several labelings defined by some algebraic structure, i.e. harmonious labeling and group distance magic labeling. In this paper we study some preliminary results on orthogonal labeling. One of the early result is the fact that cycle graph with even vertices are orthogonal, while ones with odd vertices are not. The main results in this paper state that any graph containing K3 as its subgraph is non-orthogonal and that a graph G′ obtained from adding a pendant to a vertex in orthogonal graph G is orthogonal. In the end of the paper we state the corollary that any tree is orthogonal.
Co-Authors Kiki A. Sugeng