Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A Lower Bound on the Number of Vertices of a Graph

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

DOI10.2307/2042566zbMATH Open0406.05044OpenAlexW4249827603MaRDI QIDQ4192098FDOQ4192098


Authors: Vinay G. Kane, Saraju P. Mohanty Edit this on Wikidata


Publication date: 1978


Full work available at URL: https://doi.org/10.2307/2042566





zbMATH Keywords

Lower BoundNumber of Vertices of a Graph


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)


Cites Work

  • A Lower Bound for the Number of Vertices of a Graph


Cited In (2)

  • On local connectivity of graphs
  • Maximally edge-connected and vertex-connected graphs and digraphs: A survey





This page was built for publication: A Lower Bound on the Number of Vertices of a Graph

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4192098&oldid=18033254"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 12:54. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki