Radio mean number of pendant graphs for even cycles with odd diameter

Show simple item record

dc.contributor.author Dilshan, C.
dc.contributor.author Perera, A.
dc.date.accessioned 2022-11-22T10:41:40Z
dc.date.available 2022-11-22T10:41:40Z
dc.date.issued 2022-11-03
dc.identifier.uri http://drr.vau.ac.lk/handle/123456789/630
dc.description.abstract Graph labeling is simply plugging numbers (integers) to the vertices, edges, or both in a particular graph. Here we only focus on vertex labeling. The idea of radio mean labeling is one of the most ubiquitous fields of graph labeling. The assignment (particular radio mean labeling) will give us the integers. There, the radio mean number or radio number is the integer that spans the labels in that location. The radio number rmn (G) stands for the minimum span of a radio labeling for G. This paper discusses a general proof for the radio number of pendant graphs with an even cycle (the cycle takes the product with complete graph one) having odd diameter. To take the radio number, a generalized equation must be obtained. We must treat the cycle and the diameters separately since they both have odd and even variants. Here, our attention is limited to even cycles with odd diameters. In a later project, we hope to apply our research to the entire Pendant graph family or, in the more significant case, Corona. en_US
dc.language.iso en en_US
dc.publisher Faculty of Applied Science, University of Vavuniya. en_US
dc.subject Cycle and diameter en_US
dc.subject Radio mean labeling en_US
dc.subject rmn en_US
dc.title Radio mean number of pendant graphs for even cycles with odd diameter en_US
dc.type Conference paper en_US
dc.identifier.proceedings FARS - 2022 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account