中文
相关论文

相关论文: Circulant $S_2$ graphs

200 篇论文

The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…

组合数学 · 数学 2021-11-05 Jiyong Chen , Cai Heng Li , Cheryl E. Praeger , Shu-Jiao Song

A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…

组合数学 · 数学 2020-08-05 Edita Máčajová , Martin Škoviera

In the present paper, we investigate the complexity of infinite family of graphs $H_n=H_n(G_1,\,G_2,\ldots,G_m)$ obtained as a circulant foliation over a graph $H$ on $m$ vertices with fibers $G_{1},\,G_{2},\ldots,G_{m}.$ Each fiber…

组合数学 · 数学 2019-02-18 Young Soo Kwon , Alexander Mednykh , Ilya Mednykh

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

组合数学 · 数学 2023-09-06 Maria Chudnovsky , Ian Malcolm Johnson McInnis

We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including…

组合数学 · 数学 2016-06-13 Sho Kubota

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V(G)|$, the graph $G$ is called very well-covered. The class…

A graph $X$ is said to be unstable if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is nontrivially unstable if it is…

组合数学 · 数学 2021-08-12 Ademir Hujdurović , Đorđe Mitrović , Dave Witte Morris

Given a meromorphic function $s: \mathbb{C}\to \mathbb{P}^{1}$, we obtain a family of fiber-preserving dominating holomorphic maps from $\mathbb{C}^{2}$ onto $\mathbb{C}^{2}\setminus graph(s)$ defined in terms of the flows of complete…

复变函数 · 数学 2014-09-03 Alvaro Bustinduy

The canonical double cover $B(X)$ of a graph $X$ is the direct product of $X$ and $K_2$. If $Aut(B(X)) \cong Aut(X) \times \mathbb{Z}_2$ then $X$ is called stable; otherwise $X$ is called unstable. An unstable graph is nontrivially unstable…

组合数学 · 数学 2022-01-11 Blas Fernandez , Ademir Hujdurović

The $c_2$ invariant is an arithmetic graph invariant introduced by Schnetz and developed by Brown and Schnetz in order to better understand Feynman integrals. This document looks at the special case where the graph in question is a…

组合数学 · 数学 2016-01-01 Karen Yeats

A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…

组合数学 · 数学 2020-12-17 Chris Godsil , Maxwell Levit , Olha Silina

In 1985, Arjeh Cohen and Jacques Tits proved the existence of a 4-cycle-free 2-fold cover of the hypercube. This Cohen-Tits cover is closely related to the signed adjacency matrix that Hao Huang used last year in his proof of the…

组合数学 · 数学 2020-11-18 Maxwell Levit

Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W.~Kantor's non-classical $\mathrm{GQ}(5^2,5)$, are stumbling stones for existing…

组合数学 · 数学 2018-09-19 Christian Pech , Maja Pech

This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…

组合数学 · 数学 2026-05-13 Vilfred Kamalappan

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

组合数学 · 数学 2015-05-04 Iván Dario Castrillón , Roberto Cruz , Enrique Reyes

A graph $X$ is said to be "unstable" if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is "nontrivially unstable" if…

组合数学 · 数学 2022-01-11 Ademir Hujdurović , Đorđe Mitrović , Dave Witte Morris

It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear…

组合数学 · 数学 2018-09-18 Lu Lu , Qiongxiang Huang , Jiangxia Hou

Let C be a smooth, projective and geometrically integral curve defined over a finite field F. For each closed point P of C, let R be the ring of functions that are regular outside P, and let K be the completion at P of the function field of…

群论 · 数学 2022-05-17 Claudio Bravo

We address a question posed by Fessler-Jensen-Kelsey-Owen regarding graphs whose second gonality is greater than the first by exactly 1. We answer the question affirmatively under a stronger condition, thereby characterising the entire…

组合数学 · 数学 2025-11-25 Šimun Dropuljić , Yoav Len