The Minimum Number of Edges and Vertices in a Graph With Edge Connectivity $N$ and $M$ $N$-Bonds

Bulletin of the American Mathematical Society
doi 10.1090/s0002-9904-1974-13557-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

The (Σ + 1)-Edge-Connectivity Augmentation Problem Without Creating Multiple Edges of a Graph

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

A Random Graph With a Subcritical Number of Edges

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

The Upper Edge Geodetic Number and the Forcing Edge Geodetic Number of a Graph

Opuscula Mathematica
Mathematics
2009English

The Laplacian Quadratic Form and Edge Connectivity of a Graph

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2015English

A Lower Bound on the Number of Vertices of a Graph

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1978English

The Upper Connected Edge Geodetic Number of a Graph

Filomat
Mathematics
2012English

Stabilization of N-, N,n-, N,n′-Methylated and Unsubstituted Simple Amidine Salts by Multifurcated Hydrogen Bonds

Spectroscopy
2006English

Small Convex Polytopes With Long Edges and Many Vertices

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2003English

Sequence Spaces M ( Φ ) $M(\phi)$ and N ( Φ ) $N(\phi)$ With Application in Clustering

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy