Copertina

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bonte, Sébastien, Devillez, Gauvain, Dusollier, Valentin, Hertz, Alain, Mélot, Hadrien
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
di: Hauweele, Pierre, et al.
Pubblicazione: (2018)

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

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

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
di: Dailly, Antoine, et al.
Pubblicazione: (2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
di: Botler, Fábio, et al.
Pubblicazione: (2025)

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
di: Bašić, Milan
Pubblicazione: (2026)

Elimination distance to bounded degree on planar graphs
di: Lindermayr, Alexander, et al.
Pubblicazione: (2020)

On expectations and variances in the hard-core model on bounded degree graphs
di: Davies, Ewan, et al.
Pubblicazione: (2025)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
di: Asensio, Sara, et al.
Pubblicazione: (2024)

Fractional domatic number and minimum degree
di: Chuet, Quentin, et al.
Pubblicazione: (2025)

Extremal minimal bipartite matching covered graphs
di: Mallik, Amit Kumar, et al.
Pubblicazione: (2024)

Tree decompositions with small width, spread, order and degree
di: Wood, David R.
Pubblicazione: (2025)

Coboundary and cosystolic expansion without dependence on dimension or degree
di: Dikstein, Yotam, et al.
Pubblicazione: (2023)

Clique-free t-matchings in degree-bounded graphs
di: Paluch, Katarzyna, et al.
Pubblicazione: (2024)

Packing chromatic critical graphs with radius at most 2
di: Gür, Aslıhan, et al.
Pubblicazione: (2026)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
di: Ai, Jiangdong, et al.
Pubblicazione: (2025)

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

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

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
di: Kelly, Tom, et al.
Pubblicazione: (2018)

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
di: Ihringer, Ferdinand
Pubblicazione: (2023)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
di: Chakraborty, Dibyayan
Pubblicazione: (2025)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
di: Gutin, Gregory, et al.
Pubblicazione: (2024)

Improved lower bounds on the maximum size of graphs with girth 5
di: Goedgebeur, Jan, et al.
Pubblicazione: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
di: Rzążewski, Paweł, et al.
Pubblicazione: (2024)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
di: d'Orsi, Tommaso, et al.
Pubblicazione: (2024)

Bounded degree QBF and positional games
di: Oijid, Nacim
Pubblicazione: (2024)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
di: Bastida, Sam, et al.
Pubblicazione: (2026)

Localization: A Framework to Generalize Extremal Graph Problems
di: Adak, Rajat, et al.
Pubblicazione: (2025)

Cube Height, Cube Width and Related Extremal Problems for Posets
di: Bastide, Paul, et al.
Pubblicazione: (2025)

Extremal digraphs for open neighbourhood location-domination and identifying codes
di: Foucaud, Florent, et al.
Pubblicazione: (2023)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
di: Botler, F., et al.
Pubblicazione: (2024)

All Graphs with at most 8 nodes are 2-interval-PCGs
di: Calamoneri, Tiziana, et al.
Pubblicazione: (2022)