scientific article; zbMATH DE number 568830

MaRDI QIDQ4294622zbMATH OpenFDO

Authors Uri N. Peled, Bruno Simeone

Publication date 10 August 1994

zbMATH Keywords

treesbipartite graphNP-hardnessthreshold graphmin-max relationsedge-dominationmaximum-weight independent setthreshold measure

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Recommendations

• The threshold weight of a graph
• A class of threshold and domishold graphs: Equistable and equidominating graphs
• Bithreshold Graphs
• Multithreshold multipartite graphs
• Threshold graphs

Cited in

(7)

• Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
• One-story buildings as tensegrity frameworks. III
• Paired threshold graphs
• The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
• The simple graph threshold number \(\sigma(r,s,a,t)\) when \(r\geq 3\) is odd and \(a\geq 2\) is even
• Distinguishing threshold of graphs
• On the adjacency matrix of a threshold graph

This page was built for publication:

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