On some variations of dominating identification in graphs | Zendy

Muhammad Fazil | Zendy; Iffat Fida Hussain | Zendy; Ateqa Akbar | Zendy; Usman Ali | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On some variations of dominating identification in graphs

Author(s) -

Muhammad Fazil,

Iffat Fida Hussain,

Ateqa Akbar,

Usman Ali

Publication year - 2021

Publication title -

kuwait journal of science

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) , connected dominating set , graph , set (abstract data type) , discrete mathematics , maximal independent set , computer science , chordal graph , vertex (graph theory) , 1 planar graph , data mining , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research