Some Domination Parameters of Arithmetic Graph Vn

Maheswari, S. Uma

doi:10.9790/5728-0261418

Cited by 11 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Otherwise, by the adjacency of V n graph, there are edges between prime number vertices and their prime power vertices and also to their prime product vertices. So, V n is connected for every n. The domination parameters of these graphs are obtained by the author and the proof of the following theorem can be found in [7].…”

Section: Arithmeticmentioning

confidence: 99%

Connected domination number of cartesian product graphs of Cayley graphs with arithmetic graphs

Maheswari¹,

Parvathi²,

Bhatathi³

et al. 2020

Malaya J. Mat.

View full text Add to dashboard Cite

The notation G 1 G 2 is the Cartesian product of two graphs. The vertex set of G 1 G 2 is V 1 × V 2 , ,where V 1 × V 2 is the Cartesian product of the sets V 1 and V 2 and any two distinct vertices (u 1 , v 1) and (u 2 , v 2) of G 1 G 2 are adjacent, if u 1 = u 2 and v 1 v 2 ∈ (G 2) or u 1 u 2 ∈ E(G 1) and v 1 = v 2. In this paper we obtain some results related to connected domination number of Cartesian product graphs of Euler Totient Cayley graphs with Arithmetic V n graphs.

show abstract

Section: Arithmeticmentioning

confidence: 99%

Connected domination number of cartesian product graphs of Cayley graphs with arithmetic graphs

Maheswari¹,

Parvathi²,

Bhatathi³

et al. 2020

Malaya J. Mat.

View full text Add to dashboard Cite

show abstract

“…In other cases, by the definition of adjacency in there exist edges between prime number vertices and their prime power vertices and also to their prime product vertices. Therefore each vertex of is connected to some vertex in The domination parameters of these graphs are studied by S.Uma Maheswari [8] and we present some of the results which we need without proofs and can be found in [12]. …”

Section: Arithmetic Graphmentioning

confidence: 99%

Some Domination Parameters of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs

Umamaheswari¹,

Maheswari²,

Manjuri³

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…Now we consider the direct product graph of Euler totient Cayley graphs with Arithmetic graph. The properties and some dominating parameters of these graphs are presented respectively in [ 5,6,7,8,9].…”

Section: Direct Product Graphsmentioning

confidence: 99%

Matching Dominating Sets of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs

UmaMaheswari¹,

Maheswari²,

Manjuri³

2012

IJCA

View full text Add to dashboard Cite

Graph Theory is one of the most flourishing branches of modern Mathematics finding widest applications in all most all branches of Science & Technology. It is applied in diverse areas such as social sciences, linguistics, physical sciences, communication engineering etc. Number Theory is one of the oldest branches of Mathematics, which inherited rich contributions from almost all greatest mathematicians, ancient and modern. Every branch of mathematics employs some notion of a product that enables the combination or decomposition of its elemental structures. Product of graphs are introduced in Graph Theory very recently and developing rapidly. In this paper, we consider direct product graphs of Cayley graphs with Arithmetic graphs and present Matching dominating set of these graphs.

show abstract

Some Domination Parameters of Arithmetic Graph Vn

Cited by 11 publications

References 8 publications

Connected domination number of cartesian product graphs of Cayley graphs with arithmetic graphs

Connected domination number of cartesian product graphs of Cayley graphs with arithmetic graphs

Some Domination Parameters of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs

Matching Dominating Sets of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs

Contact Info

Product

Resources

About