A Radio labeling of the graph G is a function g from the vertex set V (G) of G to ℤ<sup>+</sup> such that |g(u) - g(v)| ≥ diam(G) + 1 - d<sub>G</sub>(u, v), where diam(G) and d(u, v) are diameter and distance between u and ...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A102408217
2016
English
KCI등재
학술저널
451-465(15쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
A Radio labeling of the graph G is a function g from the vertex set V (G) of G to ℤ<sup>+</sup> such that |g(u) - g(v)| ≥ diam(G) + 1 - d<sub>G</sub>(u, v), where diam(G) and d(u, v) are diameter and distance between u and ...
A Radio labeling of the graph G is a function g from the vertex set V (G) of G to ℤ<sup>+</sup> such that |g(u) - g(v)| ≥ diam(G) + 1 - d<sub>G</sub>(u, v), where diam(G) and d(u, v) are diameter and distance between u and v in graph G respectively. The radio number rn(G) of G is the smallest number k such that G has radio labeling with max{g(v) : v ∈ V(G)} = k. We investigate radio number for some families of generalized caterpillar graphs.
SOMEWHAT PAIRWISE FUZZY PRE-IRRESOLUTE CONTINUOUS MAPPINGS
INT-SOFT MIGHTY FILTERS IN BE-ALGEBRAS
A NOTE ON THE CAUCHY PROBLEM FOR HEAT EQUATIONS WITH COUPLING MOVING REACTIONS OF MIXED TYPE