Independent Domination in Triangle Graphs

DOI10.1016/j.endm.2007.01.048zbMath1291.05148OpenAlexW2047899858MaRDI QIDQ3439603

Yury L. Orlovich, Igor Edm. Zverovich

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.048

zbMATH Keywords

coronacoretriangle conditiontriangle graphNP-complete problemindependent dominationco-hereditary class

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The independent domination numbers of strong product of two cycles ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ Short proofs on the structure of general partition, equistable and triangle graphs ⋮ Bipartite bihypergraphs: a survey and new results ⋮ Equistable graphs, general partition graphs, triangle graphs, and graph products ⋮ On Distance-3 Matchings and Induced Matchings ⋮ 1-Triangle graphs and perfect neighborhood sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• Independent domination in hereditary classes
• The neighbourhood number of a graph
• Clustering and domination in perfect graphs
• On domination problems for permutation and other graphs
• Complement reducible graphs
• Independent domination in chordal graphs
• Disproof of a conjecture in the domination theory
• Locally well-dominated and locally independent well-dominated graphs
• A characterization of well-covered graphs in terms of forbidden costable subgraphs
• On the independent domination number of graphs with given minimum degree
• Independent domination and matchings in graphs
• A characterization and hereditary properties for partition graphs
• Edge Dominating Sets in Graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Independent Sets in Asteroidal Triple-Free Graphs
• An induced subgraph characterization of domination perfect graphs
• Graph-Theoretic Concepts in Computer Science