The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges (Q497342): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-014-1477-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086800065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the index of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs with cut vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of (0,1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3405182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest eigenvalue of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for the signless laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not every 2-tough graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a spectral theory of graphs based on the signless Laplacian. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a spectral theory of graphs based on the signless Laplacian, III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new bounds on the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite families of \(Q\)-integral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order / rank
 
Normal rank
Property / cites work
 
Property / cites work: The signless Laplacian spectral radius of graphs with given number of pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On three conjectures involving the signless Laplacian spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique and the signless Laplacian eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs with cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the index of the signless Laplacian of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the \(Q\)-spread of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a signless Laplacian spectral characterization of \(T\)-shape trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper bounds on the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q-integral graphs with edge-degrees at most five / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some forests determined by their Laplacian or signless Laplacian spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unoriented Laplacian maximizing graphs are degree maximal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose signless Laplacian index does not exceed 4.5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of trees on \(k\) pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal signless Laplacian spectral radius of graphs with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the spectral radius of bicyclic graphs with fixed girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The signless Laplacian spectral radius of graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connection between ordinary and Laplacian spectra of bipartite graphs / rank
 
Normal rank

Latest revision as of 19:08, 10 July 2024

scientific article
Language Label Description Also known as
English
The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
scientific article

    Statements

    The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges (English)
    0 references
    0 references
    0 references
    24 September 2015
    0 references
    bicyclic graph
    0 references
    signless Laplacian
    0 references
    adjacency matrix
    0 references
    spectral radius
    0 references
    cut edge
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers