On the maximum Zagreb indices of graphs with \(k\) cut vertices (Q982233): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AutoGraphiX / rank
 
Normal rank
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/s10440-009-9534-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963693830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wiener index of graphs with more than one cut-vertex / 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: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377649 / 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: Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index / 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: Q3649253 / 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: Q5714871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extremal Zagreb indices of graphs with cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2875218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents of graphs with cut vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizer graphs for a class of extremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity index of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of connected graphs with cut vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2895372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5450337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees of extremal connectivity index / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3545992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randić ordering of chemical trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Series expansion of the directed percolation probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3643737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for the second Zagreb index of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714872 / rank
 
Normal rank

Latest revision as of 00:28, 3 July 2024

scientific article
Language Label Description Also known as
English
On the maximum Zagreb indices of graphs with \(k\) cut vertices
scientific article

    Statements

    On the maximum Zagreb indices of graphs with \(k\) cut vertices (English)
    0 references
    0 references
    0 references
    6 July 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Randić connectivity index
    0 references
    Zagreb index
    0 references
    cut vertex
    0 references
    pendent path
    0 references
    clique
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references