Almost all graphs are rigid-revisited

DOI10.1016/J.DISC.2008.11.031zbMATH Open1200.05102OpenAlexW2175403806MaRDI QIDQ1044909FDOQ1044909

Authors: Jens Kötters 

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.11.031

Recommendations

• Almost all graphs are rigid - Revisited
• On the Rigidity of Sparse Random Graphs
• scientific article; zbMATH DE number 4099374
• On the asymmetry of random regular graphs and random graphs
• Idempotent endomorphisms of a graph

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?)
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Title not available (Why is that?)
• Asymmetric graphs
• Title not available (Why is that?)
• Symmetric relations (undirected graphs) with given semigroups
• On the minimum order of graphs with given semigroup
• On Rigid Undirected Graphs
• Title not available (Why is that?)

Cited In (2)

• Almost all graphs are rigid - Revisited
• 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 Q1044909)