Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter (Q609972): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1016/j.aml.2010.08.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012828163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377649 / 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: Q4830181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377653 / 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: 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: Q3184799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714343 / 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: Q4261184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3643737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity index of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees of extremal connectivity index / 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: On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\) / 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: Extreme values of the sum of squares of degrees of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum Zagreb indices of graphs with \(k\) cut vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4907261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of bipartite graphs with given diameter / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:39, 3 July 2024

scientific article
Language Label Description Also known as
English
Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
scientific article

    Statements

    Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter (English)
    0 references
    0 references
    0 references
    1 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Zagreb indices
    0 references
    bipartite graphs
    0 references
    diameter
    0 references
    0 references