Strong elimination ordering of the total graph of a tree

DOI10.1016/0166-218X(92)90181-9MaRDI QIDQ1201815zbMATH OpenOpenAlexFDO

Authors R. Bačik, Janez Aleš

Publication date 17 January 1993

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

Full work available at URL https://doi.org/10.1016/0166-218x(92)90181-9

zbMATH Keywords

strongly chordal graphslinear algorithmstrong elimination orderingminimum weight total dominating set problem for treestotal graph tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Vertices contained in all or in no minimum total dominating set of a tree
• Steiner trees, connected domination and strongly chordal graphs
• scientific article; zbMATH DE number 1151808
• Domination, independent domination, and duality in strongly chordal graphs
• Total dominating functions on subclasses of chordal graphs

Cites work

• Characterizations of strongly chordal graphs
• Domination, independent domination, and duality in strongly chordal graphs
• Three Partition Refinement Algorithms
• Triangulated graphs and the elimination process

Cited in

(4)

• On the complexity of variations of mixed domination on graphs
• Strong tree-cographs are Birkhoff graphs
• Integrity of total transformation graphs
• Strongly simplicial vertices of powers of trees

This page was built for publication: Strong elimination ordering of the total graph of a tree

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