Efficient domination through eigenvalues

DOI10.1016/j.dam.2016.06.014zbMath1346.05211OpenAlexW2477962801MaRDI QIDQ317399

Vadim V. Lozin, Carlos J. Luz, Maria F. Pacheco, Domingos Moreira Cardoso

Publication date: 30 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.06.014

zbMATH Keywords

dominating induced matchingefficient dominating set\((k, \tau)\)-regular setsgraph eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

A survey on graphs with convex quadratic stability number ⋮ Domination and Spectral Graph Theory ⋮ An overview of \((\kappa, \tau)\)-regular sets and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating induced matchings for \(P_7\)-free graphs in linear time
• Distance regular subgraphs of a cube
• On the complexity of the dominating induced matching problem in hereditary classes of graphs
• Spectral results on regular graphs with \((k,\tau)\)-regular sets
• Main eigenvalues and \((\kappa ,\tau )\)-regular sets
• Efficient edge domination in regular graphs
• Solving the weighted efficient edge domination problem on bipartite permutation graphs
• Efficient edge domination problems in graphs
• Weighted efficient domination problem on some perfect graphs
• Perfect edge domination and efficient edge domination in graphs
• Equitable bipartitions of graphs and related results
• Perfect codes in the graphs \(O_k\)
• Weighted independent perfect domination on cocomparability graphs
• The weighted perfect domination problem and its variants
• Perfect codes in graphs
• New Polynomial Cases of the Weighted Efficient Domination Problem
• Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
• Dominating Induced Matchings
• Dominating sets in n‐cubes
• Hereditary Efficiently Dominatable Graphs
• A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs

This page was built for publication: Efficient domination through eigenvalues