An upper bound on the algebraic connectivity of outerplanar graphs
From MaRDI portal
Publication:2397528
DOI10.1016/J.DISC.2017.03.015zbMATH Open1362.05073OpenAlexW2607432867MaRDI QIDQ2397528FDOQ2397528
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.015
Recommendations
- scientific article; zbMATH DE number 7473309
- Bounds on the algebraic connectivity of graphs
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- An upper bound on algebraic connectivity of graphs with many cutpoints
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
- Bounds for the connected domination number of maximal outerplanar graphs
- scientific article; zbMATH DE number 7771352
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- The Nordhaus-Gaddum bounds for algebraic connectivity of graphs
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laplacian matrices of graphs: A survey
- Isoperimetric numbers of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral partitioning works: planar graphs and finite element meshes
- Title not available (Why is that?)
- On the Fiedler value of large planar graphs
- On the algebraic connectivity of graphs as a function of genus
Cited In (4)
This page was built for publication: An upper bound on the algebraic connectivity of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397528)
