English
Related papers

Related papers: Graceful labellings of variable windmills using Sk…

200 papers

In this paper, we characterize the potentially $(K_5-C_4)$-graphic sequences where $K_5-C_4$ is the graph obtained from $K_5$ by removing four edges of a 4 cycle $C_4$. This characterization implies a theorem due to Lai [6].

Combinatorics · Mathematics 2007-05-23 Lili Hu , Chunhui Lai

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

Combinatorics · Mathematics 2019-04-03 Wei Jin , Cheryl E. Praeger

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

Rings and Algebras · Mathematics 2026-03-03 Lia Vas

Extending results of Wyser, we determine formulas for the equivariant cohomology classes of closed orbits of certain families of spherical subgroups of $GL_n$ on the flag variety $GL_n/B$. Putting this together with a slight extension of…

Algebraic Geometry · Mathematics 2017-12-12 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

In this paper, we introduce a new family of graphs, $\Gamma(n,a)$. We show that it is an infinite family of tetravalent half-transitive Cayley graphs. Apart from that, we determine some structural properties of $\Gamma(n,a)$.

Combinatorics · Mathematics 2020-08-19 Sucharita Biswas , Angsuman Das

We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…

Combinatorics · Mathematics 2025-02-04 Silvia Properzi , Arne Van Antwerpen

We study certain spaces of vertex functions on the Cayley graphs corresponding to N-fold products of the group of integers modulo m, where m=3, 4, or 5, that are invariant under the adjacency operator that maps a value at a given vertex to…

Combinatorics · Mathematics 2020-12-23 Jeffrey A. Hogan , Joseph D. Lakey

A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states that for $n \geq 4$, every balanced bipartite graph on $2n$…

Combinatorics · Mathematics 2021-01-26 Peter Bradshaw

In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an…

Data Structures and Algorithms · Computer Science 2015-05-13 Elisângela Silva Dias , Diane Castonguay

It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilisers. However, beside a well known family of exceptional graphs, related to the lexicographic product of a cycle…

Combinatorics · Mathematics 2010-10-14 Primoz Potocnik , Pablo Spiga , Gabriel Verret

Supersymmetric heterotic string models, built from a Calabi-Yau threefold $X$ endowed with a stable vector bundle $V$, usually lead to an anomaly mismatch between $c_2(V)$ and $c_2(X)$; this leads to the question whether the difference can…

High Energy Physics - Theory · Physics 2011-05-25 Bjorn Andreas , Gottfried Curio

Let $(X,G)$ be a minimal equicontinuous dynamical system, where $X$ is a compact metric space and $G$ some topological group acting on $X$. Under very mild assumptions, we show that the class of regular almost automorphic extensions of…

Dynamical Systems · Mathematics 2019-11-13 Gabriel Fuhrmann , Dominik Kwietniak

A graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors. This paper contributes to the long term project of…

Combinatorics · Mathematics 2025-08-12 Ksenija Rozman , Primož Šparl

We show that certain extensions of classifiable C*-algebra are strongly classified by the associated six-term exact sequence in K-theory together with the positive cone of K_{0}-groups of the ideal and quotient. We apply our result to give…

Operator Algebras · Mathematics 2013-02-01 Soren Eilers , Gunnar Restorff , Efren Ruiz

Recently, we initiated the study of random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that each vertex is labeled upon its first visit. In this work, we calculate…

Combinatorics · Mathematics 2023-05-23 Sela Fried , Toufik Mansour

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Combinatorics · Mathematics 2021-01-27 Jun Gao , Qingyi Huo , Chun-Hung Liu , Jie Ma

A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…

Combinatorics · Mathematics 2012-08-17 Owen Hill , Gexin Yu

Gentle algebras are in bijection with admissible dissections of marked oriented surfaces. In this paper, we further study the properties of admissible dissections and we show that silting objects for gentle algebras are given by admissible…

Representation Theory · Mathematics 2019-04-12 Claire Amiot , Pierre-Guy Plamondon , Sibylle Schroll

We provide the rigorous foundations for a categorical approach to the classification of C*-dynamics up to cocycle conjugacy. Given a locally compact group $G$, we consider a category of (twisted) $G$-C*-algebras, where morphisms between two…

Operator Algebras · Mathematics 2022-02-22 Gabor Szabo

A graceful k-coloring of a non-empty graph $G=(V,E)$ is a proper vertex coloring $f:V(G)\rightarrow\lbrace 1,2,...,k \rbrace$, $k\geq 2$, which induces a proper edge coloring $f^{*}:E(G)\rightarrow\lbrace 1, 2, . . . , k-1 \rbrace $ defined…

Combinatorics · Mathematics 2022-11-30 D Laavanya , S Devi Yamini
‹ Prev 1 4 5 6 7 8 10 Next ›