On Square Divisor Cordial Graphs

Vaidya, S. K.; Shah, N. H.

doi:10.3329/jsr.v6i3.16412

Search citation statements

Order By: Relevance

Paper Sections

Select...

Definition141

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2017

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition.1.5: Bistar , [7] is the graph obtained by joining the center (apex) vertices of two copies of 1, by an edge.…”

Section: Definition14mentioning

confidence: 99%

Square Multiplicative Labeling for Some Graphs

2016

International Journal of Scientific and Innovative Mathematical

View full text Add to dashboard Cite

“…Definition.1.5: Bistar , [7] is the graph obtained by joining the center (apex) vertices of two copies of 1, by an edge.…”

Section: Definition14mentioning

confidence: 99%

Square Multiplicative Labeling for Some Graphs

2016

International Journal of Scientific and Innovative Mathematical

View full text Add to dashboard Cite

“…[10]). The shadow graph D 2 (G) of a connected graph G is constructed by taking two copies of G say G and G and join each vertex u in G to the neighbors of the corresponding vertex v in G .…”

mentioning

confidence: 99%

Some bistar related square sum graphs

sara¹,

Patel²

2017

IJMTT

View full text Add to dashboard Cite

A graph G = (V, E) with p vertices and q edges is said to be square sum graph, if there exists a bijection mapping f : V (G) → {0, 1, 2,. .. , p − 1} such that the induced function f * : E(G) → N defined by f * (uv) = (f (u)) 2 + (f (v)) 2 , for every uv ∈ E(G) is injective. A graph with square sum labeling is called square sum graph. In this paper we prove that restricted square graph, splitting graph and shadow graph of B n,n are square sum. We also prove that restricted total, restricted middle and degree splitting graph of B n,n , duplication of vertex and arbitrary super subdivision of B n,n are square sum graph.

show abstract

“…K. Vaidya and N. H. Shah [8] proved that • Flower graph F l n is a square divisor cordial graph for each n.…”

mentioning

confidence: 99%