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

DOI10.1016/J.DAM.2016.01.012zbMath1376.05106OpenAlexW2293718068MaRDI QIDQ1686045

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

induced matchingspectral graph theorydominating induced matching

Mathematics Subject Classification ID

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

Related Items (3)

Modelling and solving the perfect edge domination problem ⋮ Dominating induced matching in some subclasses of bipartite graphs ⋮ Some results on dominating induced matchings

Cites Work

• Unnamed Item
• On the Laplacian and signless Laplacian spectrum of a graph with \(k\) pairwise co-neighbor vertices
• Dominating induced matchings for \(P_7\)-free graphs in linear time
• On the complexity of the dominating induced matching problem in hereditary classes of graphs
• Efficient edge domination in regular graphs
• Efficient edge domination problems in graphs
• Spectra of graphs obtained by a generalization of the join graph operation
• Fast algorithms for some dominating induced matching problems
• Dominating induced matchings in graphs without a skew star
• A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs
• Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
• Dominating Induced Matchings
• Graph Classes: A Survey
• The Laplacian Spectrum of a Graph II
• Dominating induced matchings in graphs containing no long claw
• The Maximum Number of Dominating Induced Matchings

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