Zobrazeno 1 - 10
of 5 646
pro vyhledávání: '"spectral condition"'
Let $G$ be a graph and $T$ be a spanning tree of $G$. We use $Q(G)=D(G)+A(G)$ to denote the signless Laplacian matrix of $G$, where $D(G)$ is the diagonal degree matrix of $G$ and $A(G)$ is the adjacency matrix of $G$. The signless Laplacian spectral
Externí odkaz:
http://arxiv.org/abs/2412.00700
Autor:
Moschella, Ugo
We review the role of the spectral condition as a characteristic feature unifying Minkowski, de Sitter and anti de Sitter Quantum Field Theory. In this context, we highlight the role of an important class of plane waves which are either de Sitter or
Externí odkaz:
http://arxiv.org/abs/2403.15893
Publikováno v:
Discrete Applied Mathematics 360(2025)188-195
A graph $G$ contains a strong parity factor $F$ if for every subset $X\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $\delta(F)\geq1$, $d_F(u)\equiv1$ (mod 2) for any $u\in X$, and $d_F(v)\equiv0$ (mod 2) for any $v\in V(
Externí odkaz:
http://arxiv.org/abs/2402.13601
Autor:
Moschella, Ugo1,2,3 (AUTHOR) ugo.moschella@uninsubria.it
Publikováno v:
Universe (2218-1997). May2024, Vol. 10 Issue 5, p199. 21p.
Autor:
Harakeh, Mohammad, Hillairet, Luc
We study a concentration inequality for eigenfunctions of a Baouendi-Grushin operator on a cylinder or a torus. Using separation of variables, we prove that this inequality holds under a spectral multiplicity condition. Using Albert-Uhlenbeck's theor
Externí odkaz:
http://arxiv.org/abs/2312.04359
A chord of a cycle $C$ is an edge joining two non-consecutive vertices of $C$. A cycle $C$ in a graph $G$ is chorded if the vertex set of $C$ induces at least one chord. In this paper, we prove that if $G$ is a graph with order $n\geq 6$ and $\rho(G)
Externí odkaz:
http://arxiv.org/abs/2311.13323
The push to train ever larger neural networks has motivated the study of initialization and training at large network width. A key challenge is to scale training so that a network's internal representations evolve nontrivially at all widths, a proces
Externí odkaz:
http://arxiv.org/abs/2310.17813
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
For any integer $k\geq 2$, a spanning $k$-ended tree is a spanning tree with at most $k$ leaves. In this paper, we provide a tight spectral radius condition for the existence of a spanning $k$-ended tree in $t$-connected graphs, which generalizes a r
Externí odkaz:
http://arxiv.org/abs/2305.04211
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.