Concentration of rainbow k-connectivity of a multiplex random graph

DOI10.1016/J.TCS.2023.113771MaRDI QIDQ2689447zbMATH OpenOpenAlexFDO

Authors Yilun Shang

Publication date 10 March 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.tcs.2023.113771

zbMATH Keywords

random graphmultiplex networkrainbow connectivityrainbow path

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• On rainbow-k-connectivity of random graphs
• Rainbow \(k\)-connectivity of random bipartite graphs
• Rainbow \(k\)-connection in dense graphs
• Sharp concentration of the rainbow connection of random graphs
• On the threshold for rainbow connection number \(r\) in random graphs

Cites work

• scientific article; zbMATH DE number 3943863 (Why is no real title available?)
• A rainbow version of Mantel's theorem
• A sharp threshold for rainbow connection in small-world networks
• A sharp threshold for rainbow connection of random bipartite graphs
• From one to many rainbow Hamiltonian cycles
• Introduction to Random Graphs
• Multilayer networks. Structure and function
• On a rainbow version of Dirac's theorem
• On rainbow connection
• On rainbow-k-connectivity of random graphs
• On the chromatic number of random graphs
• On the concentration of the domination number of the random graph
• On the domination number of a random graph
• On the rainbow matching conjecture for 3-uniform hypergraphs
• On the strength of connectedness of a random graph
• Probability and Computing
• Radius, diameter, and minimum degree
• Rainbow \(k\)-connectivity of random bipartite graphs
• Rainbow connection in graphs
• Rainbow connection number and connected dominating sets
• Rainbow connection of random regular graphs
• Rainbow connection of sparse random graphs
• Rainbow spanning structures in graph and hypergraph systems
• Sharp concentration of the equitable chromatic number of dense random graphs
• The concentration of the chromatic number of random graphs
• The diameter of sparse random graphs
• The diameter of sparse random graphs
• The probabilistic method
• The rainbow connectivity of a graph
• Transversal factors and spanning trees

Cited in

(3)

• Two-distance vertex-distinguishing index of sparse graphs
• Optimal secret share distribution in degree splitting communication networks
• Rainbow connectivity and rainbow index of inhomogeneous random graphs

This page was built for publication: Concentration of rainbow \(k\)-connectivity of a multiplex random graph

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