Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Raridan Christopher"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 299-308 (2016)
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Externí odkaz:
https://doaj.org/article/e8799f7e78f045118123d0698de13311
In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets ($EBI$) of complete bipartite graphs $K_{m,n}$, where they examined the cases $n=1$, $2$, $3$, $4$, $5$ and the case $m=n$. Since then the problem of finding
Externí odkaz:
http://arxiv.org/abs/1509.01841
We answer two questions of Shamik Ghosh in the negative. We show that there exists a lobster tree of diameter less than 6 which accepts no alpha-labeling with two central vertices labeled by the critical number and the maximum vertex label. We also s
Externí odkaz:
http://arxiv.org/abs/1412.6984
Autor:
Hua, Hung, Raridan, Christopher
In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets of complete bipartite graphs $K_{m,n}$ by solving the cases where $n=1$, $2$, $3$, $4$, and $5$, and also the case where $m=n$. In an article soon to be pu
Externí odkaz:
http://arxiv.org/abs/1405.1673
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more than one. Call such a labeling $f$ \emph{edge-friendly}. We say an ed
Externí odkaz:
http://arxiv.org/abs/1103.5127
Publikováno v:
J. Indones. Math. Soc. Special Edition (2011) p. 71-78
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$. We also prove a lemma that is helpful to determine the edge-balanc
Externí odkaz:
http://arxiv.org/abs/1103.4994
Publikováno v:
In Discrete Mathematics 2012 312(3):574-577