A note on the characterization of domination perfect graphs | Zendy

Fulman Jason | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A note on the characterization of domination perfect graphs

Author(s) -

Fulman Jason

Publication year - 1993

Publication title -

journal of graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 54

eISSN - 1097-0118

pISSN - 0364-9024

DOI - 10.1002/jgt.3190170106

Subject(s) - mathematics , combinatorics , distance hereditary graph , characterization (materials science) , mathematical proof , perfect graph , induced subgraph , graph , perfect graph theorem , cograph , domination analysis , discrete mathematics , strong perfect graph theorem , split graph , trivially perfect graph , line graph , pathwidth , voltage graph , materials science , geometry , vertex (graph theory) , nanotechnology

A graph G is domination perfect if for each induced subgraph H of G , γ( H ) = i ( H ), where γ and i are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of domination perfect graphs. This characterization is not correct, but the ideas in [3] can be used to weaken the known sufficient conditions for a graph to be domination perfect and to obtain short proofs of some results regarding domination perfect graphs. © 1993 John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research