Open AccessOn some variations of dominating identification in graphs
Author(s) -
Muhammad Fazil,
AUTHOR_ID,
Iffat Fida Hussain,
Ateqa Akbar,
Usman Ali,
AUTHOR_ID,
AUTHOR_ID,
AUTHOR_ID
Publication year - 2021
Publication title -
maǧallaẗ al-kuwayt li-l-ʿulūm
Language(s) - English
Resource type - Journals
eISSN - 2307-4116
pISSN - 2307-4108
DOI - 10.48129/kjs.13175
Subject(s) - dominating set , combinatorics , mathematics , domination analysis , cardinality (data modeling) , discrete mathematics , graph , maximal independent set , chordal graph , computer science , vertex (graph theory) , 1 planar graph , data mining
In this study, we introduce the locating-dominating value and the location-domination polynomial of graphs and location-domination polynomials of some families of graphs were identified. Locatingdominating set of graph G is defined as the dominating set which locates all the vertices of G. And, location-domination number G is the minimum cardinality of a locating-dominating set in G.