Efficient domination through eigenvalues

DOI10.1016/J.DAM.2016.06.014zbMATH Open1346.05211OpenAlexW2477962801MaRDI QIDQ317399FDOQ317399

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

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

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)

Cites Work

• Title not available (Why is that?)
• The main eigenvalues of a graph: a survey
• An introduction to the theory of graph spectra
• Perfect codes in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distance regular subgraphs of a cube
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• New Polynomial Cases of the Weighted Efficient Domination Problem
• Efficient edge domination on hole-free graphs in polynomial time
• Dominating induced matchings
• Title not available (Why is that?)
• Dominating sets in n‐cubes
• Dominating induced matchings for \(P_7\)-free graphs in linear time
• Hereditary Efficiently Dominatable Graphs
• A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs
• 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

Cited In (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

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)