English
Related papers

Related papers: Closed graph property and Khalimsky spaces

200 papers

We find closed form formulas for the Kemeny's constant and the Kirchhoff index for the cluster $G_1\{G_2\}$ of two highly symmetric graphs $G_1$, $G_2$, in terms of the parameters of the original graphs. We also discuss some necessary…

Probability · Mathematics 2020-07-23 Jose Palacios , Greg Markowsky

A classification is given of finite $k$-set-homogeneous graphs for $k\geqslant 2$, leading to a striking result that each finite $k$-set-homogeneous graph is $k$-homogeneous. It shows that $3$-set-homogeneous graphs are rare, consisting of…

Group Theory · Mathematics 2026-02-24 Cai Heng Li , Fu-Gang Yin , Jin-Xin Zhou

In this note we make progress toward a conjecture of Durham--Fanoni--Vlamis, showing that every infinite-type surface with finite-invariance index 1 and no nondisplaceable compact subsurfaces fails to have a good curve graph, that is, a…

Geometric Topology · Mathematics 2021-09-16 Justin Lanier , Marissa Loving

Let $k \geq 2$ be an integer. We say that a graph $G$ is $(K_2 \cup kK_1)$-free if it does not contain $K_2 \cup kK_1$ as an induced subgraph. Recently, Shi and Shan conjectured that every $1$-tough and $2k$-connected $(K_2 \cup kK_1)$-free…

Combinatorics · Mathematics 2023-02-22 Katsuhiro Ota , Masahiro Sanka

Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same…

Combinatorics · Mathematics 2014-01-13 Alireza Abdollahi , Shahrooz Janbaz

A graph is $n$-e.c. ($n$-existentially closed) if for every pair of subsets $A, B$ of vertex set $V$ of the graph such that $A \cap B = \emptyset$ and $|A| + |B| = n$, there is a vertex $z$ not in $A \cup B$ joined to each vertex of $A$ and…

Combinatorics · Mathematics 2009-03-17 Le Anh Vinh

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…

Combinatorics · Mathematics 2016-11-04 Mohammad Hadi Shekarriz , Madjid Mirzavaziri

We determine all Hermitian $\mathcal{O}_{\Q(\sqrt{d})}$-matrices for which every eigenvalue is in the interval [-2,2], for each d in {-2,-7,-11,-15\}. To do so, we generalise charged signed graphs to $\mathcal{L}$-graphs for appropriate…

Number Theory · Mathematics 2011-03-24 Graeme Taylor

We show that in Cartan-Hadamard manifolds $M^n$, $n\geq 3$, closed infinitesimally convex hypersurfaces $\Gamma$ bound convex flat regions, if curvature of $M^n$ vanishes on tangent planes of $\Gamma$. This encompasses…

Differential Geometry · Mathematics 2025-10-16 Mohammad Ghomi

The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…

Combinatorics · Mathematics 2020-08-10 M. H. Bani Mostafa A. , Ebrahim Ghorbani

Let $\mathcal K$ be a complete quasivariety of completely regular universal topological algebras of continuous signature $\mathcal E$ (which means that $\mathcal K$ is closed under taking subalgebras, Cartesian products, and includes all…

General Topology · Mathematics 2012-02-22 T. Banakh , O. Hryniv

For a locally finite graph $\Gamma$, we consider its mapping class group $\text{Map}(\Gamma)$ as defined by Algom-Kfir-Bestvina. For these groups, we prove a generalization of the results of Laudenbach and Brendle-Broaddus-Putman, producing…

Geometric Topology · Mathematics 2024-10-03 Brian Udall

We show that every $(n,d,\lambda)$-graph contains a Hamilton cycle for sufficiently large $n$, assuming that $d\geq \log^{6}n$ and $\lambda\leq cd$, where $c=\frac{1}{70000}$. This significantly improves a recent result of Glock, Correia…

Combinatorics · Mathematics 2025-07-02 Asaf Ferber , Jie Han , Dingjia Mao , Roman Vershynin

The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\lambda$ can be defined by a finite set of forbidden induced subgraphs if and only…

Combinatorics · Mathematics 2025-10-08 Zilin Jiang , Alexandr Polyanskii

For a positive integer $n$ let $\mathcal{X}_n$ be either the algebra $M_n$ of $n \times n$ complex matrices, the set $N_n$ of all $n \times n$ normal matrices, or any of the matrix Lie groups $\mathrm{GL}(n)$, $\mathrm{SL}(n)$ and…

Spectral Theory · Mathematics 2025-03-27 Alexandru Chirvasitu , Ilja Gogić , Mateo Tomašević

Let $G$ be a $k$ - connected ($k \geq 2$) graph of order $n$. If $\chi(G) \geq n - k$, then $G$ is Hamiltonian or $K_k \vee (K_k^c \cup K_{n - 2k})$ with $n \geq 2 k + 1$, where $\chi(G)$ is the chromatic number of the graph $G$.

Combinatorics · Mathematics 2022-01-12 Rao Li

An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…

Combinatorics · Mathematics 2024-02-07 Jia Zhou , Zhilan Wang , Jin Yan

Let ${\mathcal M}_2(\mathbb F)$ be the algebra of 2$\times$2 matrices over the real or complex field $\mathbb F$. For a given positive integer $k\geq 1$, the $k$-commutator of $A$ and $B$ is defined by $[A,B]_k=[[A,B]_{k-1},B]$ with…

Rings and Algebras · Mathematics 2016-03-29 Meiyun Liu , Jinchuan Hou

Let $G=(V,E)$ be a graph of order $n$. A closed distance magic labeling of $G$ is a bijection $\ell \colon V(G)\rightarrow \{1,\ldots ,n\}$ for which there exists a positive integer $k$ such that $\sum_{x\in N[v]}\ell (x)=k$ for all $v\in V…

Combinatorics · Mathematics 2018-01-10 Marcin Anholcer , Sylwia Cichacz , Iztok Peterin

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that a graph $G$ is \emph{$H$-free} if $G$ does not contain an…

Combinatorics · Mathematics 2021-05-25 Marcin Stawiski
‹ Prev 1 3 4 5 6 7 10 Next ›