English
Related papers

Related papers: Weakly distance-regular digraphs of valency three,…

200 papers

Let $c:V\cup E\to\{1,2,\ldots,k\}$ be a (not necessarily proper) total colouring of a graph $G=(V,E)$ with maximum degree $\Delta$. Two vertices $u,v\in V$ are sum distinguished if they differ with respect to sums of their incident colours,…

Combinatorics · Mathematics 2018-03-13 Jakub Przybyło

In this paper we show that certain almost distance-regular graphs, the so-called $h$-punctually walk-regular graphs, can be characterized through the cospectrality of their perturbed graphs. A graph $G$ with diameter $D$ is called…

Combinatorics · Mathematics 2012-06-06 Cristina Dalfó , Edwin R. van Dam , Miquel Angel Fiol

In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}nik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of…

Combinatorics · Mathematics 2023-08-29 Xiongfeng Zhan , Lu Lu , Xueyi Huang

This article is concerned with the existence and the long time behavior of weak solutions to certain coupled systems of fourth-order degenerate parabolic equations of gradient flow type. The underlying metric is a Wasserstein-like…

Analysis of PDEs · Mathematics 2016-09-23 Daniel Matthes , Jonathan Zinsl

Radial convolution operators on free groups with nonnegative kernel of weak type $(2,2)$ and of restricted weak type $(2,2)$ are characterized. Estimates of weak type $(p,p)$ are obtained as well for $1<p<2.$

Functional Analysis · Mathematics 2007-05-23 T. Pytlik , R. Szwarc

In 2017, Qiao and Koolen showed that for any fixed integer $D\geq 3$, there are only finitely many such graphs with $\theta_{\min}\leq -\alpha k$, where $0<\alpha<1$ is any fixed number. In this paper, we will study non-bipartite…

Combinatorics · Mathematics 2019-01-07 Zhi Qiao , Yifan Jing , Jack Koolen

A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular…

Combinatorics · Mathematics 2015-11-25 Marc Cámara , Edwin R. van Dam , Jack H. Koolen , Jongyook Park

For a graph $\Gamma$, a positive integer $s$ and a subgroup $G\leq \Aut(\Gamma)$, we prove that $G$ is transitive on the set of $s$-arcs of $\Gamma$ if and only if $\Gamma$ has girth at least $2(s-1)$ and $G$ is transitive on the set of…

Combinatorics · Mathematics 2012-01-23 Alice Devillers , Wei Jin , Cai Heng Li , Cheryl E. Praeger

We consider divergence form, second-order strongly parabolic systems in a cylindrical domain with a finite number of subdomains under the assumption that the interfacial boundaries are $C^{1,\text{Dini}}$ and $C^{\gamma_{0}}$ in the spatial…

Analysis of PDEs · Mathematics 2020-05-19 Hongjie Dong , Longjuan Xu

A connected graph $\Gamma=(V,E)$ of valency at least $3$ is called a basic $2$-arc-transitive graph if its full automorphism group has a subgroup $G$ with the following properties: (i) $G$ acts transitively on the set of $2$-arcs of…

Combinatorics · Mathematics 2022-10-11 Zai Ping Lu , Ruo Yu Song

In a graph A, for each two arbitrary vertices g, h with d(g,h)=2,|MAg2h|=mAg2h is introduced the number of edges of A that are closer to g than to h. We say A is a 2-edge distance-balanced graph if we have mAg2h=mAh2g. In this article, we…

Combinatorics · Mathematics 2023-09-07 Zohreh Aliannejadi , Mehdi alaeiyan , Alireza Gilani , Jafar Asadpour

In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connected bipartite Cayley (vertex-transitive) graph is…

Combinatorics · Mathematics 2016-12-12 Qiuli Li , Xing Gao

The weak cop number of infinite graphs can be seen as a coarse-geometric analogue to the cop number of finite graphs. We show that every vertex transitive graph with at least one thick end has infinite weak cop number. It follows that every…

Combinatorics · Mathematics 2025-03-14 Florian Lehner

Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant…

Combinatorics · Mathematics 2010-06-15 Greg Markowsky , Jacobus Koolen

We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…

Combinatorics · Mathematics 2026-04-17 Csaba Biró , Caroline E. Boone , Beth Novick , Hazel Torek

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

Combinatorics · Mathematics 2017-07-18 Da-Wei Yang , Yan-Quan Feng , Jin Ho Kwak , Jaeun Lee

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta , Ashish Kumar Upadhyay

We study weakly coupled $U(1)$ theories in $AdS_3$, their associated charged BTZ solutions, and their charged spectra. We find that modular invariance of the holographic dual two-dimensional CFT and compactness of the gauge group together…

High Energy Physics - Theory · Physics 2016-11-23 Miguel Montero , Gary Shiu , Pablo Soler

A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of…

Combinatorics · Mathematics 2014-12-10 Michael Giudici , Luke Morgan , Primož Potočnik , Gabriel Verret

We completely characterize the weak differentiability (or, in other words Gateaux differentiability) of the norm in the spaces of bounded multilinear maps. Also, we obtain a multilinear generalization of the well-known Bhatia-\v{S}emrl…

Functional Analysis · Mathematics 2023-05-31 Saikat Roy
‹ Prev 1 4 5 6 7 8 10 Next ›