Proximity and remoteness in graphs: Results and conjectures
From MaRDI portal
Publication:3100689
DOI10.1002/net.20450zbMath1232.05062OpenAlexW2055572845WikidataQ123235739 ScholiaQ123235739MaRDI QIDQ3100689
Pierre Hansen, Mustapha Aouchiche
Publication date: 21 November 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20450
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Proximity in triangulations and quadrangulations, Proximity, remoteness and distance eigenvalues of a graph, Minimum status of series-reduced trees with given parameters, On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs, Relationships between some distance-based topological indices, Proximity, remoteness and maximum degree in graphs, Unnamed Item, Further results on the Merrifield-Simmons index, Comparing eccentricity-based graph invariants, Minimum status of trees with a given degree sequence, Comparative results and bounds for the eccentric-adjacency index, Proximity and average eccentricity of a graph, Network descriptors based on betweenness centrality and transmission and their extremal values, Proof of conjectures on remoteness and proximity in graphs, Proximity and remoteness in directed and undirected graphs, On the peripheral Wiener index of graphs, The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs, Which numbers are status differences?, Nordhaus-Gaddum relations for proximity and remoteness in graphs, Proximity, remoteness and girth in graphs, Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree, On eccentric distance sum and degree distance of graphs, Open problems on graph eigenvalues studied with AutoGraphiX, Comparative study of distance-based graph invariants, Wiener Index and Remoteness in Triangulations and Quadrangulations, Proximity, remoteness and minimum degree, The difference between remoteness and radius of a graph
Uses Software
Cites Work
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- The average distance and the independence number
- Unnamed Item
- Unnamed Item
