Independent Domination Degree of Standard Graphs of Adriatic \((a,b)\)-KA Indices
Open Access
- 25 December 2023
- journal article
- research article
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1421-1428
Abstract
The dominating set \(D\) of the graph \(K=(V,E)\) is the independent dominating set (Ids), the independent domination number \(i(K)\) of the graph \(K\) is the minimum cardinality of id. In this article, we introduce the new independent degree domination (idd) of each vertices \(s\in V(K)\), denoted by \(d_{id}(s)\) and compute the Adriatic \((a,b)\)-KA index for book graphs, cycle middle graphs and windmill graphs.
Keywords
This publication has 9 references indexed in Scilit:
- New Bounds for the Randić Index of GraphsJournal of Mathematics, 2021
- Computation of Adriatic (a, b)-KA Index of some NanostructuesInternational Journal of Mathematics Trends and Technology, 2021
- Minus F and Square F-Indices and Their Polynomials of Certain DendrimersEarthline Journal of Mathematical Sciences, 2019
- Nano-Zagreb Index and Multiplicative Nano-Zagreb Index of Some Graph OperationsInternational Journal of Computing Science and Applied Mathematics, 2019
- Entire Zagreb indices of graphsDiscrete Mathematics, Algorithms and Applications, 2018
- Fundamentals of Domination in Graphs2013
- Independent domination in graphs: A survey and recent resultsDiscrete Mathematics, 2013
- Liar’s domination in graphsDiscrete Mathematics, 2009
- On maximum number of minimal dominating sets in graphsElectronic Notes in Discrete Mathematics, 2005