Pair Difference Cordiality of Mirror Graph,shadow Graph and Splitting Graph of Certain Graphs

Ponraj, R.; Gayathri, A.; SOMASNDARAM, S

doi:10.47087/mjm.1089672

Cited by 2 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition 2.4: (3) The Shadow graph D 2 (G) of a connected graph G is formed by taking two copies of G say G ′ and G ′′ . Join…”

Section: Methodsmentioning

confidence: 99%

Lucas Antimagic Labeling of some Star Related Graphs

Sumathi¹,

Chandravadana²

2022

IJST

View full text Add to dashboard Cite

Objective: To identify a new family of Lucas antimagic graph. Methods: A (p, q) graph G is said to be a Lucas antimagic graph if there exists a bijectionare all distinct (where E(u) is the set of edges incident to u). Findings: In this paper the Lucas Antimagic Labeling of Subdivision of star, Shadow graph of star, Splitting graph of star, Subdivision of Bistar, Shadow graph of Bistar, Splitting graph of Bistar are found. Novelty: It involves the mathematical formulation for labeling the edges of a given graph which in turn gives rise to a new type of labeling called the Lucas antimagic labeling.

show abstract

“…Definition 2.4: (3) The Shadow graph D 2 (G) of a connected graph G is formed by taking two copies of G say G ′ and G ′′ . Join…”

Section: Methodsmentioning

confidence: 99%

Lucas Antimagic Labeling of some Star Related Graphs

Sumathi¹,

Chandravadana²

2022

IJST

View full text Add to dashboard Cite

show abstract

“…Two K n graphs with a cut edge is called n-barbell graph B n (8) . Let K be a graph and K ′ be a replica of K then under the mapping χ : K → K ′ defined by χ(u) = u ′ the mirror graph M r (K) is accomplished from K ∪ K ′ by joining the vertex u ∈ K to the vertex χ(u) of K ′ for all u ∈ K (9) . Let K be a graph and K ′ be a copy of K then under the mapping χ : K → K ′ defined by χ(u) = u ′ the Shadow graph D 2 (K) is accomplished from K ∪ K ′ by joining the vertex u ∈ K to the vertex neighborhood χ(u) of K ′ for all u ∈ K (10) .…”

Section: Introductionmentioning

confidence: 99%

Outer Triple Connected Corona Domination Number of Graphs

Mahadevan,

Niveditha,

Sivagnanam

2024

IJST

View full text Add to dashboard Cite

Background/ Objective: Given a graph G, a dominating set is said to be corona dominating set if every vertex such that or there exist a vertex if then . A corona dominating set is said to be an outer triple connected corona dominating set if any three vertices in lie on a path. The minimum cardinality taken over all the outer triple connected corona dominating sets of is called outer triple connected corona dominating number and it is denoted by . The study aims to find the outer triple connected corona domination number of some graphs. Method: To obtain outer triple connected corona domination number say m by proving and . To prove for a graph G we find a outer triple connected corona dominating set of G with cardinality m and then to prove we prove by contradiction. Findings: We investigated the above parameter for some derived graphs of path, cycle and wheel graph. Novelty : Outer triple connected corona domination number is a new concept in which the conditions of corona domination and triple connected are linked together. Keywords: Corona Domination, Pendent Vertex, Support Vertex, Triple Connected, Isolated Vertex, Pendant vertes

show abstract

Pair Difference Cordiality of Mirror Graph,shadow Graph and Splitting Graph of Certain Graphs

Cited by 2 publications

References 9 publications

Lucas Antimagic Labeling of some Star Related Graphs

Lucas Antimagic Labeling of some Star Related Graphs

Outer Triple Connected Corona Domination Number of Graphs

Contact Info

Product

Resources

About