Cover Image

Maximum Eccentric Connectivity Index for Graphs with Given Diameter

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hauweele, Pierre, Hertz, Alain, Mélot, Hadrien, Ries, Bernard, Devillez, Gauvain
Format:	Preprint
Published:	2018
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
by: Devillez, Gauvain, et al.
Published: (2018)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Extremal Chemical Graphs for the Arithmetic-Geometric Index
by: Hertz, Alain, et al.
Published: (2024)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021)

PHOEG: an online tool for discovery and education in extremal graph theory
by: Bonte, Sébastien, et al.
Published: (2026)

Knowledge management in House of Graphs
by: Devillez, Gauvain, et al.
Published: (2026)

Turán Graphs, Stability Number, and Fibonacci Index
by: Bruyère, Véronique, et al.
Published: (2008)

Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
by: Bruyère, Véronique, et al.
Published: (2008)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
by: Lucke, Felicia, et al.
Published: (2023)

Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)

Graph Reconstruction with Connectivity Queries
by: Kluk, Kacper, et al.
Published: (2024)

Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
by: Azam, Naveed Ahmed, et al.
Published: (2025)

Eccentric Connectivity Index of Strongly Connected Digraphs
by: Chakooth, Vysakh, et al.
Published: (2025)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
by: Lucke, Felicia
Published: (2025)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
by: Weiß, Meike, et al.
Published: (2025)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
by: Weiß, Meike, et al.
Published: (2026)

Bounding Width on Graph Classes of Constant Diameter
by: Dabrowski, Konrad K., et al.
Published: (2025)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

Diameter Bounds for Friends-and-Strangers Graphs
by: Akella, Amogh, et al.
Published: (2025)

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
by: Auger, David, et al.
Published: (2024)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
by: Sumnicht, Christopher, et al.
Published: (2024)

Connected Dominating Sets in Triangulations
by: Bose, Prosenjit, et al.
Published: (2023)

On Circuit Diameter Bounds via Circuit Imbalances
by: Dadush, Daniel, et al.
Published: (2021)

On the Modular Chromatic Index of Random Hypergraphs
by: Carenini, Gaia, et al.
Published: (2025)

Connected Subtraction Games on Subdivided Stars
by: Dailly, Antoine, et al.
Published: (2018)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Proper Rainbow Saturation Numbers for Cycles
by: Halfpap, Anastasia, et al.
Published: (2024)