An improvement of spectral conditions for Hamilton-connected graphs (Q5888823): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and Hamiltonicity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacian spectral radius and Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral conditions for some graphical properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extremal number of edges in Hamiltonian connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient spectral conditions on Hamilton-connected and traceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges, spectral radius and Hamilton-connectedness of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral condition for Hamiltonicity of a graph / 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: Q4898149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient spectral conditions on Hamiltonian and traceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and Hamiltonian properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral analogues of Erdős' theorem on Hamilton-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Inequalities for the Largest Eigenvalue of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound of the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the sum of the squares of the degrees of a graph / rank
 
Normal rank

Latest revision as of 00:38, 1 August 2024

scientific article; zbMATH DE number 7678670
Language Label Description Also known as
English
An improvement of spectral conditions for Hamilton-connected graphs
scientific article; zbMATH DE number 7678670

    Statements

    An improvement of spectral conditions for Hamilton-connected graphs (English)
    0 references
    25 April 2023
    0 references
    Hamilton-connected
    0 references
    minimum degree
    0 references
    spectral radius
    0 references
    signless Laplacian
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references