A lower bound for the algebraic connectivity of a graph in terms of the domination number (Q1617025): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Old and new results on algebraic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic connectivity and the characteristic set of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremizing algebraic connectivity subject to graph theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having domination number half their order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on the algebraic connectivity of connected graphs with fixed girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic connectivity of graphs under perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic connectivity of weighted trees under perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the algebraic connectivity of a graph in terms of the number of cutpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of Laplacian spectrum of graphs based on the domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic vertices of trees<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian graph eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on graph eigenvalues. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect on the algebraic connectivity of a tree by grafting or collapsing of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination-balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ordering of trees and connected graphs by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least eigenvalue of signless Laplacian of graphs under perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs / rank
 
Normal rank

Latest revision as of 07:33, 17 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for the algebraic connectivity of a graph in terms of the domination number
scientific article

    Statements

    A lower bound for the algebraic connectivity of a graph in terms of the domination number (English)
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    algebraic connectivity
    0 references
    domination number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references