Amanote Research

Amanote Research

    RegisterSign In

An Upper Bound on Algebraic Connectivity of Graphs With Many Cutpoints

Electronic Journal of Linear Algebra - United States
doi 10.13001/1081-3810.1063
Full Text
Open PDF
Abstract

Available in full text

Categories
Number TheoryAlgebra
Date

January 1, 2001

Authors
Stephen Kirkland
Publisher

University of Wyoming Libraries


Related search

An Improved Upper Bound for the Order of Mixed Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2018English

An Upper Bound for the Chromatic Number of Line Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2007English

An Algebraic Characterization of Rainbow Connectivity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On an Upper Bound for Sherman’s Inequality

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2016English

An Algebraic Characterization of Projective-Planar Graphs

Journal of Graph Theory
GeometryTopology
2003English

On the Upper Bound of the Number of Real Zeros of a Random Algebraic Polynomial

Journal of Classical Analysis
2012English

Thrackles: An Improved Upper Bound

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Algebraic Graphs With Class (Functional Pearl)

2017English

An Experiment on the Upper Bound of Interjudge Agreement

1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy