Almost all graphs are rigid - Revisited

DOI10.1016/J.ENDM.2005.06.105zbMATH Open1200.05101OpenAlexW2108519944MaRDI QIDQ3439403FDOQ3439403

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

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

zbMATH Keywords

rigid graphsalmost all graphsunretractive graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymmetric graphs
• Title not available (Why is that?)
• 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)