An upper bound on algebraic connectivity of graphs with many cutpoints.
Kirkland, S. (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
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:
The third smallest eigenvalue of the Laplacian matrix.
Pati, Sukanta (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On the Vertex Separation of Cactus Graphs
Markov, Minko (2007)
Serdica Journal of Computing
Similarity:
This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.