Efficient domination through eigenvalues

DOI10.1016/J.DAM.2016.06.014MaRDI QIDQ317399zbMATHOpenAlexFDO

Authors Vadim Lozin, Carlos J. Luz, Maria F. Pacheco, D. M. 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

\((k, \tau)\)-regular setsdominating induced matchingefficient dominating setgraph 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)

Recommendations

• scientific article; zbMATH DE number 907925
• Dominating Sets and Eigenvalues of Graphs
• Efficient total domination in digraphs
• scientific article; zbMATH DE number 4085682
• A fixed-parameter tractable algorithm for matrix domination
• Efficient domination in circulant graphs
• Generalized domination and efficient domination in graphs
• Efficient (j,k)-domination
• scientific article; zbMATH DE number 1151809
• Efficient domination in Mycielski's graphs

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 52076 (Why is no real title available?)
• scientific article; zbMATH DE number 91051 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs
• An introduction to the theory of graph spectra
• Distance regular subgraphs of a cube
• Dominating induced matchings
• Dominating induced matchings for \(P_7\)-free graphs in linear time
• Dominating sets in n‐cubes
• Efficient edge domination in regular graphs
• Efficient edge domination on hole-free graphs in polynomial time
• Efficient edge domination problems in graphs
• Equitable bipartitions of graphs and related results
• Hereditary efficiently dominatable graphs
• Main eigenvalues and \((\kappa ,\tau )\)-regular sets
• New polynomial cases of the weighted efficient domination problem
• On the complexity of the dominating induced matching problem in hereditary classes of graphs
• Perfect codes in graphs
• Perfect codes in the graphs \(O_k\)
• Perfect edge domination and efficient edge domination in graphs
• Solving the weighted efficient edge domination problem on bipartite permutation graphs
• Spectral results on regular graphs with \((k,\tau)\)-regular sets
• The main eigenvalues of a graph: a survey
• The weighted perfect domination problem and its variants
• Weighted efficient domination problem on some perfect graphs
• Weighted independent perfect domination on cocomparability graphs

Cited in

(4)

• Domination and spectral graph theory
• On efficient dominating sets in simplicial graphs
• An overview of \((\kappa, \tau)\)-regular sets and their applications
• A survey on graphs with convex quadratic stability number

This page was built for publication: Efficient domination through eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317399)