Medium Domination Decomposition of Graphs
DOI:
https://doi.org/10.23755/rm.v44i0.890Keywords:
Domination Number, Medium Domination Number, Medium Domination DecompositionAbstract
A set of vertices in a graph dominates if every vertex in is either in or adjacent to a vertex in . The size of any smallest dominating set is called domination number of . The concept of Medium Domination Number was introduced by Vargor and Dunder which finds the total number of vertices that dominate all pairs of vertices and evaluate the average of this value. The Medium domination Number is a notation which uses neighbourhood of each pair of vertices. For G = (V, E) and ∀u,v∈ V if u, v are adjacent they dominate each other, then atleast dom (u, v) = 1. The total number of vertices that dominate every pair of vertices is defined as TDV(G)=∑dom(u,v), for every u,v∈V(G). For any connected, undirected, loopless graph G of order p, the Medium Domination Number MD(G) = . In this paper we have introduced the new concept Medium Domination Decomposition. A decomposition of a graphG is said to be Medium Domination Decomposition (MDD) if
References
Duygu Vargor, Pinar Dundar, “The Medium Domination Number ofa Graph”, International Journal of pure and applied mathematics volume of No.3, 2011 297-306.
Fairouz Beggas, “Decomposition and Domination of Some Graphs” Data Structures and Algorithms [cs.DS]. University Claude Bernard Lyon 1,2017.
S.Arumugan and S.Ramachandran,“Invitation to Graph Theory”, SciTech publications (India) PVT.LTD.(2003).
Teresa W. Haynes, Stephen T. Hedetnimi and Peter J. Slater, “Fundamentals of Domination inGraphs” Marcel Dekkar, Inc.,New York, 1998.
T.I. Joel and E.E.R. Merly, “Geodetic Decomposition of Graphs”, Journal of Computer and Mathematical Sciences, 9(7)(2018), 829-833.
Downloads
Published
Issue
Section
License
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:
- Free access for all users worldwide
- Increased visibility and readership
- Rapid publication
- No spatial constraints
- Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)
Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified.
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.
