Matching Domination of Cartesian Product of Two Graphs


Authors : P Bhaskarudu

Volume/Issue : Volume 2 - 2017, Issue 5 - May

Google Scholar : https://goo.gl/d7WhQi

Scribd : https://goo.gl/POIHMb

Thomson Reuters ResearcherID : https://goo.gl/3bkzwv

The paper concentrates on the theory of domination in graphs. In this paper we define a new parameter on domination called matching domination set, matching domination number and we have investigated some properties on matching domination of cartesian product of two graphs. The following are the results: If ui1 and uj2 then degG1(C)G2 (ui, vj ) = degG1 (ui).degG2 (vj ) If G1, G2 are simple finite graphs without isolated vertices. G1(C)G2 is a simple finite graph without isolated vertices.The cartisean product graph of two simple graphs is not a complete graph. If G1 and G2 are bipartite graphs them G1(C)G2 is a bipartite graph. If G1 and G2 are any two graphs without isolated vertices then γm[G1(C)G2] ≤ | V1 | .γmd(G2); γmd(G1). | V2 |

Keywords : Cartesian product of graphs,omination Set,Domination number, Complete graphs, Isolated vertices, degree, regular graphs, bipartite graphs.

CALL FOR PAPERS


Paper Submission Last Date
31 - December - 2021

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe