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

Semi-hyper-connected vertex transitive graphs

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

DOI10.1016/j.disc.2008.01.031zbMath1169.05006OpenAlexW4210416632MaRDI QIDQ1011726

Zhao Zhang

Publication date: 9 April 2009

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

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


zbMATH Keywords

Cayley graphvertex transitivesemi-hyper-connected


Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)


Related Items (1)

The existence and upper bound for two types of restricted connectivity



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Subsets with small sums in abelian groups. I: The Vosper property
  • Connectivity of vertex and edge transitive graphs
  • Semi-hyper-connected edge transitive graphs
  • On optimally-\(\lambda^{(3)}\) transitive graphs
  • Minimale \(n\)-fach kantenzusammenhängende Graphen
  • On unreliability polynomials and graph connectivity in reliable network synthesis
  • Synthesis of reliable networks - a survey
  • Connectivity of transitive graphs




This page was built for publication: Semi-hyper-connected vertex transitive graphs

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