Inequalities for the number of walks in graphs (Q378237): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-013-9766-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000198292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hölder type inequalities in cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of Eigenvalues of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spektren endlicher Grafen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5648382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results in the theory of graph spectra / 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: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the sum of squares of degrees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of walks in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactness results in extremal graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of walks and degree powers in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral approach to determining the number of walks in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for the Number of Walks in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three observations on nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Radius and Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Almost Regular Graphs / 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: Q5450433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp lower bound of the spectral radius of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On comparing Zagreb indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities in quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two inequalities in nonnegative symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of the elements of the powers of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality Arising in Genetical Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walks and the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of the squares of degrees: sharp asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5644003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3066830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5454385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal trees with given degree sequence for the Randić index / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eigenvalues of a Graph and Its Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral bounds for the clique and independence numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:39, 7 July 2024

scientific article
Language Label Description Also known as
English
Inequalities for the number of walks in graphs
scientific article

    Statements

    Inequalities for the number of walks in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    growth of the number of walks
    0 references
    inequalities
    0 references
    spectral radius
    0 references
    graph energy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references