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 …
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
A New notion of classical mean graphs based on duplicating operations
Classical mean labeling of a graph G with p vertices and q edges is an injective function
from the vertex set of G to the set {1, 2, 3,…, q+ 1} such that the edge labels obtained from …
from the vertex set of G to the set {1, 2, 3,…, q+ 1} such that the edge labels obtained from …
Reflection of Duplicating Operations in the Graphs Pn and Pn∘K1 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)[Λ …
assignment Λ is from 1 to 1+ q along with bijective link assignment Λ⋆(uv)=⌊ 1/3Γ (u, v)[Λ …
[PDF][PDF] Research Article A New Notion of Classical Mean Graphs Based on Duplicating Operations
AR Kannan, P Manivannan, K Loganathan… - 2022 - academia.edu
Classical mean labeling of a graph G with p vertices and q edges is an injective function
from the vertex set of G to the set 1, 2, 3,..., q+ 1 {} such that the edge labels obtained from …
from the vertex set of G to the set 1, 2, 3,..., q+ 1 {} such that the edge labels obtained from …