On independent domination topological indices of graphs

Anjaneyulu Mekala, U. Vijaya Chandra Kumar and R. Murali

International Journal of Mathematics in Operational Research, 2024, vol. 29, issue 3, 345-353

Abstract: A dominating set (ds) D of a graph G = (V, E) is an independent dominating set (Ids), if the induces subgraph 〈D〉 has no edges. The independent domination number i(G) of graph G is the minimal cardinality of an Ids. In this paper we define a new independent degree domination (Idd) of each vertex k ∈ V(G), called an Idd of k and denoted by d_id(k) are introduced, as well as certain domination indices based on this Idd and also fundamental properties are investigated. We establish exact value for the Idd Zagreb indices of book graph, windmill graph, middle graph of cycle.

Keywords: independent domination number; independent minimal dominating number; independent domination degree Zagreb indices. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=142449 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:29:y:2024:i:3:p:345-353

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().