Vertex Connected Domination Polynomial of some Coalescence of Complete and Wheel Graphs | Zendy

Nechirvan Badal Ibrahim | Zendy; Hariwan Fadhil M.Salih | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Vertex Connected Domination Polynomial of some Coalescence of Complete and Wheel Graphs

Author(s) -

Nechirvan Badal Ibrahim,

Hariwan Fadhil M.Salih

Publication year - 2020

Publication title -

international journal of mathematical sciences and computing

Language(s) - English

Resource type - Journals

eISSN - 2310-9033

pISSN - 2310-9025

DOI - 10.5815/ijmsc.2020.06.01

Subject(s) - neighbourhood (mathematics) , vertex (graph theory) , combinatorics , tuple , feedback vertex set , dominating set , mathematics , wheel graph , discrete mathematics , graph , computer science , line graph , graph power , mathematical analysis

In this paper, we introduce new results of vertex connected dominating set and vertex connected domination polynomial of vertex identification, edge introduced and t-tuple of complete graph, also we determine new results of vertex connected dominating set and vertex connected domination polynomial of vertex identification, edge introduced and t-tuple of wheel graph .

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