Imagen de Portada

Stiffness matrices of graph blow-ups and the $d$-dimensional algebraic connectivity of complete bipartite graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jung, Yunseong, Lew, Alan
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Partition density, star arboricity, and sums of Laplacian eigenvalues of graphs
por: Lew, Alan
Publicado: (2024)

The stability of independence polynomials of complete bipartite graphs
por: Chen, Guo, et al.
Publicado: (2025)

The distinguishing number of complete bipartite and crown graphs
por: Chen, Lei, et al.
Publicado: (2026)

Complexes of graphs with bounded independence number
por: Kim, Minki, et al.
Publicado: (2019)

Combinatorial sufficient conditions for graph rigidity and applications to random graphs
por: Krivelevich, Michael, et al.
Publicado: (2026)

Weak saturation numbers of large complete bipartite graphs
por: Akhmejanova, Margarita, et al.
Publicado: (2025)

Nonorientable genus embedding of nearly complete bipartite graphs
por: Lv, Shengxiang
Publicado: (2023)

A note on the lacking polynomial of the complete bipartite graph
por: Alofi, Amal, et al.
Publicado: (2024)

Unavoidable patterns in $2$-colorings of the complete bipartite graph
por: Hansberg, Adriana, et al.
Publicado: (2024)

Separating path systems for cubic graphs and for complete bipartite graphs
por: Fernandes, Cristina, et al.
Publicado: (2025)

Laplacian eigenvalues of independence complexes via additive compound matrices
por: Lew, Alan
Publicado: (2023)

Connectivity keeping paths for k-connected bipartite graphs
por: Ji, Meng
Publicado: (2023)

Independent transversal blow-up of graphs
por: Dai, Tianjiao, et al.
Publicado: (2025)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2025)

Turán number of complete bipartite graphs with bounded matching number
por: Luo, Huan, et al.
Publicado: (2024)

A simple proof of the existence of complete bipartite graph immersion in graphs with independence number two
por: Chen, Rong, et al.
Publicado: (2024)

A discrepancy dichotomy for 1-factorizations of signed complete bipartite graphs
por: Xue, Yisai, et al.
Publicado: (2026)

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
por: Yang, Qing, et al.
Publicado: (2022)

Size of bipartite graphs with given diameter and connectivity constraints
por: Mafunda, Sonwabile
Publicado: (2025)

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
por: Yang, Qing, et al.
Publicado: (2023)

The connectivity of friends-and-strangers graphs on complete multipartite graphs
por: Zhu, Honglin
Publicado: (2023)

On quadratic embeddability of bipartite graphs and theta graphs
por: Młotkowski, Wojciech, et al.
Publicado: (2024)

Revisiting $d$-distance (independent) domination in trees and in bipartite graphs
por: Bujtás, Csilla, et al.
Publicado: (2025)

The double Hall property and cycle covers in bipartite graphs
por: Barát, János, et al.
Publicado: (2023)

The smallest normalized signless $\infty$-Laplacian eigenvalue for non-bipartite connected graphs
por: Dai, Yi
Publicado: (2024)

Turán number of the odd-ballooning of complete bipartite graphs
por: Peng, Xing, et al.
Publicado: (2023)

Enumeration of spanning trees and resistance distances of generalized blow-up graphs
por: Liu, Hechao, et al.
Publicado: (2025)

On bipartite biregular large graphs
por: Araujo-Pardo, G., et al.
Publicado: (2024)

The minimum size of 2-connected chordal bipartite graphs
por: Zhang, Licheng, et al.
Publicado: (2024)

Highly connected graphs have highly connected spanning bipartite subgraphs
por: Yuster, Raphael
Publicado: (2024)

Bunkbed conjecture for complete bipartite graphs and related classes of graphs
por: Richthammer, Thomas
Publicado: (2022)

Equitable factorizations of highly edge-connected graphs: complete characterizations
por: Hasanvand, Morteza
Publicado: (2024)

An optimal construction for complete graph embeddings with duals of low connectivity
por: Sun, Timothy
Publicado: (2024)

Odd complete bipartite minors in graphs with independence number two
por: Chen, Rong, et al.
Publicado: (2025)

Spread blow-up lemma with an application to perturbed random graphs
por: Nenadov, Rajko, et al.
Publicado: (2024)

Minimum degree conditions for graph rigidity
por: Krivelevich, Michael, et al.
Publicado: (2024)

Word-representability of co-bipartite graph
por: Das, Biswajit, et al.
Publicado: (2025)

Flow polytopes for extensions of bipartite graphs
por: Braun, Benjamin, et al.
Publicado: (2025)

On the construction of cospectral nonisomorphic bipartite graphs
por: Kannan, M. Rajesh, et al.
Publicado: (2021)

Non-bipartite k-common graphs
por: Kral, Daniel, et al.
Publicado: (2020)