Graph labeling

JA Gallian - The electronic journal of combinatorics, 2012 - combinatorics.org
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Enhanced Effectiveness in Various Ladder Graphs Based on the F-Centroidal Meanness Criterion

A Rajesh Kannan, S Murali Krishnan, K Loganathan… - Mathematics, 2023 - mdpi.com
Graph labeling allows for the representation of additional attributes or properties associated
with the vertices, edges, or both of graphs. This can provide a more comprehensive and …

Reflection of Duplicating Operations in the Graphs Pn and PnK1 Based on the F‐Centroidal Meanness Property

AR Kannan, K Loganathan, P Usha… - Journal of …, 2024 - Wiley Online Library
A graph admits flooring function of centroidal meanness property if its injective node
assignment Λ is from 1 to 1+ q along with bijective link assignment Λ⋆(uv)=⌊ 1/3Γ (u, v)[Λ …

Further investigation on the super classical mean labeling of graphs obtained from paths

A Rajesh Kannan, G Thirupathi… - Journal of Intelligent & … - content.iospress.com
Consider the graph G, with the injection Ω from node set to the first p+ q natural numbers. Let
us assume that the ceiling function of the classical average of the node labels of the end …

[PDF][PDF] F-Centroidal Mean Labelling of Trees and

R Gopi - academia.edu
F-Centroidal Mean Labelling of Trees and Cycle Related Graphs Page 1 International Journal of
Aquatic Science ISSN: 2008-8019 Vol 12, Issue 02, 2021 3623 F-Centroidal Mean Labelling of …

[PDF][PDF] F-Centroidal Mean Labelling of Trees and Cycle Related Graphs

P Ambika, BS Kumar, R Gopi - journal-aquaticscience.com
F-Centroidal Mean Labelling of Trees and Cycle Related Graphs Page 1 International Journal
of Aquatic Science ISSN: 2008-8019 Vol 12, Issue 02, 2021 3623 F-Centroidal Mean Labelling …

[PDF][PDF] F–Centroidal Mean Labeling of Some Graphs

R Gopi, BS Kumar - academia.edu
All graphs in this paper are finite, simple and undirected. Terms not defined here are used in
the sense of [10]. Let G (V, E) be a graph with p vertices and q edges. For a detailed survey …