Number of walks and degree powers in a graph (Q1025536): Difference between revisions

From MaRDI portal
RedirectionBot (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 / OpenAlex ID
 
Property / OpenAlex ID: W2023055866 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.0860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree powers in graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turán type problem concerning the powers of the degrees of a graph / 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: Sums of powers of the degrees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5648382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the sum of the squares of the degrees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4758141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261184 / rank
 
Normal rank

Latest revision as of 16:11, 1 July 2024

scientific article
Language Label Description Also known as
English
Number of walks and degree powers in a graph
scientific article

    Statements

    Number of walks and degree powers in a graph (English)
    0 references
    0 references
    0 references
    19 June 2009
    0 references
    graph
    0 references
    walks
    0 references
    degree powers
    0 references
    adjacency matrix
    0 references
    Laplacian matrix
    0 references

    Identifiers