On the dominating induced matching problem: spectral results and sharp bounds

DOI10.1016/J.DAM.2016.01.012MaRDI QIDQ1686045zbMATH OpenOpenAlexFDO

Authors Peng Zhang

Publication date 20 December 2017

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

Full work available at URL http://hdl.handle.net/10773/18244

zbMATH Keywords

dominating induced matchinginduced matchingspectral graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The Maximum Number of Dominating Induced Matchings
• Some results on dominating induced matchings
• Dynamics of nonlinear three-dimensionalwaves on the interface between two fluids in a channel with low-sloping bottom and top
• Exact algorithms for dominating induced matching based on graph partition
• Efficient edge domination in regular graphs

Cites work

• A polynomial-time algorithm for the dominating induced matching problem in the class of convex graphs
• An introduction to the theory of graph spectra
• Dominating induced matchings
• Dominating induced matchings for \(P_7\)-free graphs in linear time
• Dominating induced matchings in graphs containing no long claw
• Dominating induced matchings in graphs without a skew star
• Efficient edge domination in regular graphs
• Efficient edge domination on hole-free graphs in polynomial time
• Efficient edge domination problems in graphs
• Fast algorithms for some dominating induced matching problems
• Graph Classes: A Survey
• On the complexity of the dominating induced matching problem in hereditary classes of graphs
• On the Laplacian and signless Laplacian spectrum of a graph with k pairwise co-neighbor vertices
• Spectra of graphs obtained by a generalization of the join graph operation
• The Laplacian Spectrum of a Graph II
• The Maximum Number of Dominating Induced Matchings

Cited in

(5)

• Some results on dominating induced matchings
• Modelling and solving the perfect edge domination problem
• Exact algorithms for dominating induced matching based on graph partition
• Subgraphs and the Laplacian spectrum of a graph
• Dominating induced matching in some subclasses of bipartite graphs

This page was built for publication: On the dominating induced matching problem: spectral results and sharp bounds

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