A Semi-Induced Subgraph Characterization of Upper Domination Perfect Graphs

Journal of Graph Theory - United States
doi 10.1002/(sici)1097-0118(199905)31:1<29::aid-jgt4>3.0.co;2-g
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley-Blackwell

Related search

The Paired-Domination and the Upper Paired-Domination Numbers of Graphs

Opuscula Mathematica
Mathematics
2015English

A New Characterization of Trivially Perfect Graphs

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2015English

The Number of Disjoint Perfect Matchings in Semi-Regular Graphs

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

The [A,b]-Domination and [A,b]-Total Domination of Graphs

Journal of Mathematics Research
2017English

Connected Domination Polynomial of Graphs

Fasciculi Mathematici
2018English

A Class of Weakly Perfect Graphs

Czechoslovak Mathematical Journal
Mathematics
2010English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

A Review on Relationship Between Domination Independent Transversal Domination and Equitable Domination in Graphs

International Journal of Mathematics Trends and Technology
2017English

On Exponential Domination of Graphs

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy