Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs

DOI10.1016/J.ENDM.2004.03.014MaRDI QIDQ3439140zbMATH OpenOpenAlexFDO

Authors Paolo Detti, C. Meloni, Marco Pranzo

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2004.03.014

zbMATH Keywords

edge dominationgraph algorithmsseries parallel graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 867715
• scientific article; zbMATH DE number 3910441
• On minimum dominating sets with minimum intersection
• scientific article; zbMATH DE number 867663
• Efficient edge domination problems in graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3906530 (Why is no real title available?)
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Set-up coordination between two stages of a supply chain
• The edge Hamiltonian path problem is NP-complete
• The Recognition of Series Parallel Digraphs

Cited in

(3)

• A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
• Local search algorithms for finding the Hamiltonian completion number of line graphs
• A bi-objective coordination setup problem in a two-stage production system

This page was built for publication: Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs

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