The following pages link to (Q4692391):
Displaying 50 items.
- The Steiner Wiener index of a graph (Q274705) (← links)
- The bipartite edge frustration of hierarchical product of graphs (Q277458) (← links)
- Eccentric connectivity index of graphs with subdivided edges (Q277481) (← links)
- On Wiener and multiplicative Wiener indices of graphs (Q277607) (← links)
- On the number of spanning trees of multi-star related graphs (Q293235) (← links)
- The vertex version of weighted Wiener number for bicyclic molecular structures (Q305652) (← links)
- Proximity, remoteness and distance eigenvalues of a graph (Q313783) (← links)
- The distance spectrum of corona and cluster of two graphs (Q322014) (← links)
- The forcing vertex detour monophonic number of a graph (Q322058) (← links)
- Eccentric digraphs of trees (Q326892) (← links)
- Radio secure number of a graph (Q327660) (← links)
- Upper detour monophonic number of a graph (Q327673) (← links)
- On the extremal properties of the average eccentricity (Q356266) (← links)
- Graph operations and neighbor rupture degree (Q364548) (← links)
- Iterated joining of rooted trees (Q367061) (← links)
- Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
- The communicability distance in graphs (Q414715) (← links)
- Comparison between Kirchhoff index and the Laplacian-energy-like invariant (Q417499) (← links)
- The walk distances in graphs (Q427888) (← links)
- Proximity and average eccentricity of a graph (Q436337) (← links)
- Distance-sum heterogeneity in graphs and complex networks (Q450259) (← links)
- New inequalities between information measures of network information content (Q460228) (← links)
- Characterization of super-radial graphs (Q472142) (← links)
- Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes (Q476903) (← links)
- A cut locus for finite graphs and the farthest point mapping (Q501076) (← links)
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs (Q505439) (← links)
- The distance spectra of Cayley graphs of Coxeter groups (Q533786) (← links)
- Spiders are status unique in trees (Q534035) (← links)
- On the distance distribution of trees (Q548265) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Relation between Wiener numbers of quasi-hexagonal chains and quasi-polyomino chains (Q625661) (← links)
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances (Q628311) (← links)
- On the sizes of graphs and their powers: the undirected case (Q643002) (← links)
- Diameter-vital edges in a graph (Q657835) (← links)
- From ternary strings to Wiener indices of benzenoid chains (Q678878) (← links)
- On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs (Q725516) (← links)
- On relation between Kirchhoff index, Laplacian-energy-like invariant and Laplacian energy of graphs (Q726501) (← links)
- A matrix-based approach to searching colored paths in a weighted colored multidigraph (Q732496) (← links)
- A method for repairing the inconsistency of fuzzy preference relations (Q812600) (← links)
- Characterization of eccentric digraphs (Q819811) (← links)
- Terminal Wiener index (Q839392) (← links)
- A new geometric-arithmetic index (Q848172) (← links)
- A bypassing path based routing algorithm for the pyramid structures (Q856156) (← links)
- Monophonic numbers of the join and composition of connected graphs (Q870979) (← links)
- Coalescent random walks on graphs (Q875357) (← links)
- A generalized broadcasting schema for the mesh structures (Q884585) (← links)
- Modelling the navigation potential of a web page (Q924137) (← links)
- The Wiener polynomial of the \(k\)th power graph (Q925435) (← links)
- The convexity spectra of graphs (Q944736) (← links)
- Information processing in complex networks: Graph entropy and information functionals (Q945216) (← links)
