Pages that link to "Item:Q609972"
From MaRDI portal
The following pages link to Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter (Q609972):
Displaying 19 items.
- The Zagreb indices of four operations on graphs (Q668948) (← links)
- On extremal Zagreb indices of trees with given domination number (Q671118) (← links)
- Extremal values on Zagreb indices of trees with given distance \(k\)-domination number (Q1691326) (← links)
- The Zagreb indices of graphs based on four new operations related to the lexicographic product (Q1738106) (← links)
- Bipartite graphs with the maximal value of the second Zagreb index (Q1940990) (← links)
- On the spectral radius and energy of the weighted adjacency matrix of a graph (Q2007661) (← links)
- Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices (Q2009006) (← links)
- Computing SS index of certain dendrimers (Q2052114) (← links)
- On the Kirchhoff index of bipartite graphs with given diameters (Q2192105) (← links)
- Zeroth-order general Randić index of cactus graphs (Q2293835) (← links)
- Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter (Q2357143) (← links)
- On the extremal cacti of given parameters with respect to the difference of Zagreb indices (Q2424819) (← links)
- Comparing the Zagreb indices of the NEPS of graphs (Q2449219) (← links)
- THE ZAGREB INDICES OF BIPARTITE GRAPHS WITH MORE EDGES (Q3459031) (← links)
- (Q5011059) (← links)
- Extremal tetracyclic graphs with respect to the first and second Zagreb indices (Q5134459) (← links)
- Further results on the reciprocal degree distance of graphs (Q5963642) (← links)
- The first general Zagreb index of graphs and their line graphs (Q6584752) (← links)
- On maximum Zagreb indices of bipartite graphs with a given connectivity (Q6650429) (← links)