Bondage Number of Lexicographic Product of Two Graphs | Zendy

G. Deepak | Zendy; M. H. Indiramma. | Zendy; G Bindu. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Bondage Number of Lexicographic Product of Two Graphs

Author(s) -

G. Deepak,

M. H. Indiramma.,

G Bindu.

Publication year - 2019

Publication title -

international journal of innovative technology and exploring engineering

Language(s) - English

Resource type - Journals

ISSN - 2278-3075

DOI - 10.35940/ijitee.i8521.078919

Subject(s) - lexicographical order , combinatorics , mathematics , domination analysis , graph , product (mathematics) , cardinality (data modeling) , discrete mathematics , computer science , vertex (graph theory) , database , geometry

The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with a domination number greater than the domination number of G. In this paper, we study the bondage number of the Lexicographic product of two paths, Lexicographic product of path and a graph with given maximum degree.

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