Results 41 to 50 of about 18,773 (121)
A Note on Path Signed Digraphs [PDF]
, 2010 The concept of a line signed digraph is generalized to that of a path signed ...
S. Vijay +5 more
core +1 more source
European Journal of Combinatorics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Science and Technology IndonesiaLet Cay(S,A) be the Cayley digraph of a finite rectangular group S with connection set A. We derive explicit formulas for several vertex-degree–based topological indices of these digraphs, including the Randić, Zagreb, sum-connectivity, geometric ...
Denpong Pongpipat, Nuttawoot Nupo
doaj +1 more source
The conjunction of Cayley digraphs
Discrete Mathematics, 1982 If G"1 and G"2 are digraphs with vertex sets V"1 and V"2, then the conjunction of G"1 and G"2, denoted G"1 . G"2, is a digraph with vertex set V"1 x V"2 in which there is an arc from (x"1, x"2) to (y"1, y"2) if there is an arc from x"1 to y"1 in G"1 and an arc from x"2 to y"2 in G"2.
openaire +3 more sources
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
On a Pursuit Game on Cayley Digraphs
European Journal of Combinatorics, 1987 The author considers a pursuit game on a graph G which was previously studied by A. Quilliot, M. Aigner and M. Fromme, and others; for the rules see e.g. [\textit{M. Aigner} and \textit{M. Fromme}, Discrete Appl. Math. 8, 1-11 (1984; Zbl 0539.05052)].
openaire +2 more sources
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
Explicit Cayley Covers of Kautz Digraphs [PDF]
The Electronic Journal of Combinatorics, 2011 Given a finite set $V$ and a set $S$ of permutations of $V$, the group action graph $\mathrm{GAG}(V,S)$ is the digraph with vertex set $V$ and arcs $(v,v^\sigma)$ for all $v\in V$ and $\sigma\in S$. Let $\langle S\rangle$ be the group generated by $S$. The Cayley digraph $\textrm{Cay}(\langle S\rangle, S)$ is called a Cayley cover of $\mathrm{GAG}(V,S)
openaire +2 more sources
On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group Sym ( 7 )
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 261-274, July 2025.ABSTRACT Terwilliger algebras are finite‐dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance‐regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups Sym ( n ), for 3 ≤ n ≤ 6, have been studied and completely determined ...
Allen Herman +2 more
wiley +1 more source
A Note of Non‐Existence of Strongly Regular and Deza Graphs
Electronics Letters, Volume 61, Issue 1, January/December 2025.ABSTRACT In this letter, we prove that strongly regular graphs and Deza digraphs do not exist with parameters (pm,k,2m,2m)$(p^m,k,2^m,2^m)$ where m=3,4$m=3,4$. As a consequence, we provide many parameters for which there is no a difference set.
Fernando Andres Benavides +1 more
wiley +1 more source