The algebraic connectivity of graphs with given circumference

DOI10.1016/J.TCS.2018.12.005zbMATH Open1423.05105OpenAlexW2902660630MaRDI QIDQ2632019FDOQ2632019

Authors: Jie Xue, Huiqiu Lin, Jinlong Shu 

Publication date: 17 May 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.12.005

Recommendations

• The least algebraic connectivity of graphs
• Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
• The minimum algebraic connectivity of graphs with a given clique number
• Extremizing algebraic connectivity subject to graph theoretic constraints
• The algebraic connectivity of graphs with given stability number

zbMATH Keywords

circumferencealgebraic connectivityextremal graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Cites Work

• Graph theory
• Exploring complex networks
• Title not available (Why is that?)
• Spectra of graphs
• An introduction to the theory of graph spectra
• Consensus and Cooperation in Networked Multi-Agent Systems
• Laplacian matrices of graphs: A survey
• Commutativity and spectra of Hermitian matrices
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Title not available (Why is that?)
• Extremizing algebraic connectivity subject to graph theoretic constraints
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• Title not available (Why is that?)
• Old and new results on algebraic connectivity of graphs
• The smallest values of algebraic connectivity for unicyclic graphs
• The ordering of trees and connected graphs by algebraic connectivity
• The minimal Laplacian spectral radius of trees with a given diameter
• The minimal Laplacian spectral radius of trees with diameter 4
• On the Laplacian spectral radii of trees
• Expanding and forwarding
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• Maximum algebraic connectivity augmentation is NP-hard
• Ordering trees by algebraic connectivity
• The algebraic connectivity of lollipop graphs
• Algebraic connectivity of \(k\)-connected graphs.
• Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
• Algebraic connectivity of interdependent networks
• Hamiltonian graphs of given order and minimum algebraic connectivity

Cited In (13)

• 2-connected graphs with the minimum algebraic connectivity
• The minimum algebraic connectivity of graphs with a given clique number
• The algebraic connectivity of lollipop graphs
• Surgery principles for the spectral analysis of quantum graphs
• The least algebraic connectivity of graphs
• Title not available (Why is that?)
• The algebraic connectivity of graphs with given stability number
• Hamiltonian graphs of given order and minimum algebraic connectivity
• Algebraic connectivity of network-of-networks having a graph product structure
• Delta invariant for Eulerian digraphs
• The algebraic connectivity of barbell graphs
• The circumference of the square of a connected graph
• Algebraic connectivity of lollipop graphs: a new approach

This page was built for publication: The algebraic connectivity of graphs with given circumference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632019)