Vertex-based and edge-based centroids of graphs
From MaRDI portal
Publication:2333199
Recommendations
Cites work
- A new sufficient condition for pancyclability of graphs
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
- An algorithm for Hamiltonian cycles under implicit degree conditions.
- Analyzing lattice networks through substructures
- Calculating the edge Wiener and edge Szeged indices of graphs
- Centroid, leaf-centroid, and internal-centroid
- Distance in graphs
- From the connectivity index to various Randić-type descriptors
- Further results on the largest matching root of unicyclic graphs
- scientific article; zbMATH DE number 5642713 (Why is no real title available?)
- scientific article; zbMATH DE number 3765830 (Why is no real title available?)
- scientific article; zbMATH DE number 3499785 (Why is no real title available?)
- scientific article; zbMATH DE number 6750340 (Why is no real title available?)
- scientific article; zbMATH DE number 6750341 (Why is no real title available?)
- Network entropies based on independent sets and matchings
- On distances in vertex-weighted trees
- On the generalized Wiener polarity index of trees with a given diameter
- On the sum of all distances in composite graphs
- Optimal trees for functions of internal distance
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Some new results on distance-based graph invariants
- Some results on the Wiener index of iterated line graphs
- Sums of distances between vertices/leaves in k-ary trees
- The clique-transversal set problem in claw-free graphs with degree at most 4
- The edge-Wiener index of a graph
- The edge-Wiener index, the Szeged indices and the PI index of benzenoid systems in sub-linear time
- The extremal values of connective eccentricity index for trees and unicyclic graphs
- The Wiener polarity index of graph products.
- Variations of distance-based invariants of trees
- Wiener index of line graphs
- Wiener index of trees: Theory and applications
- Wiener index, Harary index and graph properties
- Wiener index, Harary index and Hamiltonicity of graphs
- Wiener polarity index and its generalization in trees
Cited in
(16)- Role of memory effect in the evolution of cooperation based on spatial prisoner's dilemma game
- Sum of weighted distances in trees
- The coefficients of the immanantal polynomial
- Infinite family of 2-connected transmission irregular graphs
- A note on extremal trees with degree conditions
- Nordhaus-Gaddum type results for graph irregularities
- Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
- Some extremal ratios of the distance and subtree problems in binary trees
- On distances in vertex-weighted trees
- Bounds for scattering number and rupture degree of graphs with genus
- On the Steiner hyper-Wiener index of a graph
- Extremality of VDB topological indices over f-benzenoids with given order
- Vector centrality in hypergraphs
- Centrality and betweenness: vertex and edge decomposition of the Wiener index
- scientific article; zbMATH DE number 1186097 (Why is no real title available?)
This page was built for publication: Vertex-based and edge-based centroids of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333199)