2015
DOI: 10.26637/mjm304/019
|View full text |Cite
|
Sign up to set email alerts
|

Double quadrilateral snakes on k-odd sequential harmonious labeling of graphs

Abstract: The objective of this paper is to investigate some $k$-odd sequential harmonious labeling of graphs. In particular, we show that $k$-odd sequential harmonious labeling of double quadrilateral snakes $\left(2 Q_x\right.$-snakes) for each $x \geq 1$. We also prove that, $2 m Q_x$-snakes are $k$-odd sequential harmonious labeling of graphs for each $m, x \geq 1$. Finally, we present some examples and verified to illustrate proposed theories.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…. , 𝑛 βˆ’ 1 to new vertex 𝑣 𝑖 , π‘₯ 𝑖 and to the new vertex 𝑀 𝑖 and 𝑦 𝑖 respectively and adding an edge between each pair of vertex (𝑣 𝑖 , 𝑀 𝑖 ) and (π‘₯ 𝑖 , 𝑦 𝑖 ) [17]. A double quadrilateral snake graph is denoted by 𝐷(𝑄 𝑛 ) for 𝑛 β‰₯ 2.…”
Section: Double Quadrilateral Snake Graph 𝑫(𝑸 𝒏 )mentioning
confidence: 99%
“…. , 𝑛 βˆ’ 1 to new vertex 𝑣 𝑖 , π‘₯ 𝑖 and to the new vertex 𝑀 𝑖 and 𝑦 𝑖 respectively and adding an edge between each pair of vertex (𝑣 𝑖 , 𝑀 𝑖 ) and (π‘₯ 𝑖 , 𝑦 𝑖 ) [17]. A double quadrilateral snake graph is denoted by 𝐷(𝑄 𝑛 ) for 𝑛 β‰₯ 2.…”
Section: Double Quadrilateral Snake Graph 𝑫(𝑸 𝒏 )mentioning
confidence: 99%