Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Connectivity of friends-and-strangers graphs on random pairs

From MaRDI portal
Publication:2111926
Jump to:navigation, search

DOI10.1016/j.disc.2022.113266OpenAlexW4309734294MaRDI QIDQ2111926

Lanchao Wang, Yaojun Chen

Publication date: 17 January 2023

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

Full work available at URL: https://arxiv.org/abs/2208.00801


zbMATH Keywords

connectivityrandom graphfriends-and-strangers graph


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)


Related Items (2)

Connectedness of friends-and-strangers graphs of complete bipartite graphs and others ⋮ The connectedness of the friends-and-strangers graph of a lollipop and others




Cites Work

  • Edge disjoint placement of graphs
  • Graph puzzles, homotopy, and the alternating group
  • Subgraphs of graphs. I
  • Typical and extremal aspects of friends-and-strangers graphs
  • On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
  • Friends and strangers walking on graphs
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Connectivity of friends-and-strangers graphs on random pairs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2111926&oldid=14606289"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki