Degree sequence of configuration model with vertex faults

MaRDI QIDQ2906765zbMATH OpenFDO

Authors Yilun Shang

Publication date 5 September 2012

Published in Notes on Number Theory and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphcommunication networksdegree sequenceconfiguration modelfaculty graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Recommendations

• Configuring random graph models with fixed degree sequences
• Conditional fault tolerance of arrangement graphs
• Fault tolerance in the arrangement graphs
• Structure fault-tolerance of arrangement graphs
• On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance
• The structure fault tolerance of arrangement graphs
• Linearly many faults in arrangement graphs
• Degree sequences in graphs
• scientific article; zbMATH DE number 713480
• Conditional fault tolerance in a class of Cayley graphs

Cited in

(4)

• On connectivity of conditional configuration graphs under destruction
• Focusing of maximum vertex degrees in random faulty scaled sector graphs
• The effect of random edge removal on network degree sequence
• The impact of degree variability on connectivity properties of large networks

This page was built for publication: Degree sequence of configuration model with vertex faults

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