Pages that link to "Item:Q2333199"
From MaRDI portal
The following pages link to Vertex-based and edge-based centroids of graphs (Q2333199):
Displaying 12 items.
- Role of memory effect in the evolution of cooperation based on spatial prisoner's dilemma game (Q1632792) (← links)
- Sum of weighted distances in trees (Q1730222) (← links)
- The coefficients of the immanantal polynomial (Q2007498) (← links)
- Infinite family of 2-connected transmission irregular graphs (Q2007640) (← links)
- A note on extremal trees with degree conditions (Q2007783) (← links)
- Nordhaus-Gaddum type results for graph irregularities (Q2008199) (← links)
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
- Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
- On distances in vertex-weighted trees (Q2335160) (← links)
- Bounds for scattering number and rupture degree of graphs with genus (Q2335659) (← links)
- On the Steiner hyper-Wiener index of a graph (Q2335663) (← links)
- Extremality of VDB topological indices over f-benzenoids with given order (Q2662598) (← links)