Zobrazeno 1 - 10
of 969
pro vyhledávání: '"05C99"'
Autor:
Lin, Huiqiu, You, Zhe
The definition of Ricci curvature on graphs given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Math., 2009. Recently, a powerful limit-free formulation of Lin-Lu-Yau curvature using graph Laplacian was given in M\"{u
Externí odkaz:
http://arxiv.org/abs/2410.21887
Autor:
Campbell, Rutger, Davies, James, Distel, Marc, Frederickson, Bryce, Gollin, J. Pascal, Hendrey, Kevin, Hickingbotham, Robert, Wiederrecht, Sebastian, Wood, David R., Yepremyan, Liana
Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say that a graph
Externí odkaz:
http://arxiv.org/abs/2410.19295
A $k$-height on a graph $G=(V, E)$ is an assignment $V\to\{0, \ldots, k\}$ such that the value on ajacent vertices differs by at most $1$. We study the Markov chain on $k$-heights that in each step selects a vertex at random, and, if admissible, incr
Externí odkaz:
http://arxiv.org/abs/2410.08992
Autor:
Lazar, Ioana-Claudia
We investigate the structure of the minimal displacement set in weakly systolic complexes. We show that such set is systolic and that it embeds isometrically into the complex. As corollaries, we prove that any isometry of a weakly systolic complex ei
Externí odkaz:
http://arxiv.org/abs/2409.03850
Autor:
Lin, Huiqiu, You, Zhe
The definition of Ricci curvature on graphs in Bakry-\'Emery's sense based on curvature dimension condition was introduced by Lin and Yau [\emph{Math. Res. Lett.}, 2010]. Hua and Lin [\emph{Comm. Anal. Geom.}, 2019] classified unweighted graphs satis
Externí odkaz:
http://arxiv.org/abs/2408.09823
Autor:
Anil, Arun, Changat, Manoj, K-Sheela, Lekshmi Kamal, Shanavas, Ameera Vaheeda, Chavara, John J., Narasimha-Shenoi, Prasanth G., Schmidt, Bruno J., Stadler, Peter F.
Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures such as posets and directed graphs. We first show that betweenness in pos
Externí odkaz:
http://arxiv.org/abs/2407.07741
For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of $T$ and no
Externí odkaz:
http://arxiv.org/abs/2407.06054
This paper gives exact formulas for the regularity of powers of edge ideals of an edge-weighted integrally closed cycle.
Comment: arXiv admin note: text overlap with arXiv:2403.03609, arXiv:2401.02111
Comment: arXiv admin note: text overlap with arXiv:2403.03609, arXiv:2401.02111
Externí odkaz:
http://arxiv.org/abs/2407.05077
Given a function $f\colon V(G) \to \mathbb{Z}_{\geq 0}$ on a graph $G$, $AN(v)$ denotes the set of neighbors of $v \in V(G)$ that have positive labels under $f$. In 2021, Ahangar et al.~introduced the notion of $[k]$-Roman Dominating Function ([$k$]-
Externí odkaz:
http://arxiv.org/abs/2406.11688
The restricted edge pebbling distribution is a distribution of pebbles on the edges of $G$ is the placement of pebbles on the edges with the restriction that only an even number of pebbles should be placed on the edges with labels $0$. Given an SDC l
Externí odkaz:
http://arxiv.org/abs/2406.02259