An upper bound on algebraic connectivity of graphs with many cutpoints.
Kirkland, S. (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Extremizing algebraic connectivity subject to graph theoretic constraints.”
An upper bound on algebraic connectivity of graphs with many cutpoints.
Distance in graphs
Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)
Czechoslovak Mathematical Journal
Similarity:
Distance domination and distance irredundance in graphs.
Hansberg, Adriana, Meierling, Dirk, Volkmann, Lutz (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of cut-vertices in a graph.
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
One-two descriptor of graphs
K. CH. Das, I. Gutman, D. Vukičević (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix.
Johnson, Charles R., Saiago, Carlos M. (2002)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
A characterization of graphs in which some minimum dominating set covers all the edges
Bert L. Hartnell, Douglas F. Rall (1995)
Czechoslovak Mathematical Journal
Similarity: