Imagen de Portada

Bound for the energy of graphs in terms of degrees and leaves

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Arizmendi, Octavio, Gurrola-Viramontes, Samuel
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics 05C60, 05C80
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Universal diameter bounds for random graphs with given degrees
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

The number and structure of connected graphs with a fixed degree sequence
por: Bell, Sasha, et al.
Publicado: (2026)

Infinite random graphs
por: Kostana, Ziemowit, et al.
Publicado: (2026)

Scaling limits of random graphs
por: Addario-Berry, Louigi, et al.
Publicado: (2024)

Majority dynamics on sparse random graphs
por: Chakraborti, Debsoumya, et al.
Publicado: (2021)

Limits of chordal graphs with bounded tree-width
por: Castellví, Jordi, et al.
Publicado: (2023)

The sharp threshold for jigsaw percolation in random graphs
por: Cooley, Oliver, et al.
Publicado: (2018)

Isomorphisms between dense random graphs
por: Surya, Erlang, et al.
Publicado: (2023)

Almost all graphs have no cospectral mate with fixed level
por: Wang, Wei, et al.
Publicado: (2025)

Upper tail bounds for irregular graphs
por: Basak, Anirban, et al.
Publicado: (2025)

On the upper tail of star counts in random graphs
por: Akhmejanova, Margarita, et al.
Publicado: (2025)

Upper tails of subgraph counts in directed random graphs
por: Park, Jiyun
Publicado: (2024)

Extreme local statistics in random graphs: maximum tree extension counts
por: Araújo, Pedro, et al.
Publicado: (2023)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
por: Brandenberger, Anna M., et al.
Publicado: (2020)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
por: Rakotoniaina, Fameno, et al.
Publicado: (2026)

The largest common subtree of two random trees
por: Angel, Omer, et al.
Publicado: (2025)

The law of the circumference of sparse binomial random graphs
por: Anastos, Michael, et al.
Publicado: (2025)

On the jump of the cover time in random geometric graphs
por: Martinez, Carlos, et al.
Publicado: (2025)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
por: Mörters, Peter, et al.
Publicado: (2025)

Normal approximation for number of edges in random intersection graphs
por: Rybarczyk, Katarzyna, et al.
Publicado: (2025)

Tight universal bounds on the height times the width of random trees
por: Donderwinkel, Serte, et al.
Publicado: (2024)

Critical trees are neither too short nor too fat
por: Addario-Berry, Louigi, et al.
Publicado: (2023)

Tripodal structure in undersaturated random graphs
por: DiCarlo, William, et al.
Publicado: (2025)

On the evolution of random integer compositions
por: Bevan, David, et al.
Publicado: (2023)

Large Components and Trees of Random Mappings
por: Mutafchiev, Ljuben, et al.
Publicado: (2025)

On the Deepest Cycle of a Random Mapping
por: Mutafchiev, Ljuben, et al.
Publicado: (2023)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
por: Bohman, Tom, et al.
Publicado: (2024)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
por: Addario-Berry, Louigi, et al.
Publicado: (2026)

Central limit theorem for crossings in randomly embedded graphs
por: Arenas-Velilla, Santiago, et al.
Publicado: (2023)

On the concentration of the chromatic number of random graphs
por: Surya, Erlang, et al.
Publicado: (2022)

The clique chromatic number of sparse random graphs
por: Fernandez V, Manuel, et al.
Publicado: (2024)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
por: Bartha, Zsolt, et al.
Publicado: (2025)

Subgraphs in random graphs with specified degrees and forbidden edges
por: Larkin, John, et al.
Publicado: (2025)

Modularity and random graphs
por: McDiarmid, Colin, et al.
Publicado: (2025)

Random intersection graphs with communities
por: van der Hofstad, Remco, et al.
Publicado: (2018)

Isomorphisms between random $d$-hypergraphs
por: Lenoir, Théo
Publicado: (2024)

Maximising homomorphism counts between digraphs
por: Lüchtrath, Lukas, et al.
Publicado: (2026)

On the thresholds of degenerate hypergraphs
por: Chen, Yu, et al.
Publicado: (2024)

Local limit of the random degree constrained process
por: Ráth, Balázs, et al.
Publicado: (2024)

Robustness of the Sauer-Spencer Theorem
por: Allen, Peter, et al.
Publicado: (2025)