Imagen de Portada

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Bašić, Milan
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the maximum $σ$-irregularity of trees with given order and maximum degree
por: Bašić, Milan
Publicado: (2026)

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

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

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

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

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

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

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

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

On the maximum number of tangencies among $1$-intersecting curves
por: Ackerman, Eyal, et al.
Publicado: (2026)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

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

Generalising the maximum independent set algorithm via Boolean networks
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

Maximum values of the Sombor-index-like graph invariants of trees and connected graphs
por: Bašić, Milan
Publicado: (2023)

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

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

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

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

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

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

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

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

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

Seeing is not believing in limited visibility cops and robbers
por: Bašić, Bojan, et al.
Publicado: (2025)

Further results on the lower bound on reduced Zagreb index of trees
por: Bašić, Milan, et al.
Publicado: (2026)

Reachability in temporal graphs under perturbation
por: Enright, Jessica, et al.
Publicado: (2024)

Directed treewidth is closed under taking butterfly minors
por: Kim, Gunwoo, et al.
Publicado: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
por: Agdur, Vilhelm, et al.
Publicado: (2025)

Bounded degree QBF and positional games
por: Oijid, Nacim
Publicado: (2024)

The $g$-good-neighbor diagnosability of product networks under the PMC model
por: Wang, Zhao, et al.
Publicado: (2025)

In search of maximum non-overlapping codes
por: Stanovnik, Lidija, et al.
Publicado: (2023)

Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
por: Brause, Christoph, et al.
Publicado: (2022)

Rainbow Trees in Hypercubes
por: Crawford, Nicholas, et al.
Publicado: (2025)

Completely Independent Steiner Trees
por: Maheshwari, Anil, et al.
Publicado: (2026)

Product Structure and Tree-Decompositions
por: Liu, Chun-Hung, et al.
Publicado: (2024)

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

Bounds on Linear Turán Number for Trees
por: Adak, Rajat, et al.
Publicado: (2026)

Tree-partitions of graphs with given pathwidth
por: Wood, David R.
Publicado: (2026)

Burning Graph Powers and Branching Trees
por: Jansson, Jesper, et al.
Publicado: (2026)

The Excluded Tree Minor Theorem Revisited
por: Dujmović, Vida, et al.
Publicado: (2023)