Almost all graphs are rigid - Revisited

DOI10.1016/J.ENDM.2005.06.105MaRDI QIDQ3439403zbMATH OpenOpenAlexFDO

Authors Jens Kötters

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.2005.06.105

zbMATH Keywords

rigid graphsalmost all graphsunretractive graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Almost all graphs are rigid-revisited
• On the Rigidity of Sparse Random Graphs
• Asymmetric graphs
• Erdős-Rényi theory for asymmetric digraphs
• On the asymmetry of random regular graphs and random graphs

Cites work

• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Asymmetric graphs
• On the minimum order of graphs with given semigroup

Cited in

(8)

• Almost all graphs are rigid-revisited
• Asymmetric graphs
• Infinite families of asymmetric graphs
• On the Rigidity of Sparse Random Graphs
• Chromatically optimal rigid graphs
• Erdős-Rényi theory for asymmetric digraphs
• A note on \(l_ 1\)-rigid planar graphs
• Universal rigidity of complete bipartite graphs

This page was built for publication: Almost all graphs are rigid - Revisited

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