中文
相关论文

相关论文: Regular Cayley maps on dihedral groups with the sm…

200 篇论文

Let $G = (V(G), E(G))$ be a simple connected graph and $\Omega$ a subset of $ V(G)$ with $|\Omega|\geq2$. An $\Omega$-path in $G$ is a path that connects all vertices of $\Omega$. Two $\Omega$-paths $P_i$ and $P_j$ are said to be internally…

组合数学 · 数学 2025-12-23 Yi-Lu Luo , Yun-Ping Deng , Yuan Sun

The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the…

组合数学 · 数学 2019-03-26 Sriparna Chattopadhyay , Kamal Lochan Patra , Binod Kumar Sahoo

Chirality is one of the important assymmetrical property in wide area of natural science, which has been studied to predict molecular behavior. One of good methods to analyze molecules with complex structures is representing them as graphs…

几何拓扑 · 数学 2022-08-22 Howon Choi , Hyoungjun Kim , Sungjong No

Given a map with underlying graph $\mathcal{G}$, if the set of prime divisors of $|V(\mathcal{G}|$ is denoted by $\pi$, then we call the map a {\it $\pi$-map}. An orientably-regular (resp. A regular ) $\pi$-map is called {\it solvable} if…

组合数学 · 数学 2022-09-19 Xiaogang Li , Yao Tian

We analyze in this paper a random feature map based on a theory of invariance I-theory introduced recently. More specifically, a group invariant signal signature is obtained through cumulative distributions of group transformed random…

机器学习 · 计算机科学 2015-12-07 Youssef Mroueh , Stephen Voinea , Tomaso Poggio

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This…

组合数学 · 数学 2017-11-21 Jin-Xin Zhou , Sanming Zhou

For any $n$-dimensional compact spin Riemannian manifold $M$ with a given spin structure and a spinor bundle $\Sigma M$, and any compact Riemannian manifold $N$, we show an $\epsilon$-regularity theorem for weakly Dirac-harmonic maps . As a…

偏微分方程分析 · 数学 2011-02-19 Changyou Wang , Deliang Xu

We study how iterated and composed completely positive maps act on operator-valued kernels. Each kernel is realized inside a single Hilbert space where composition corresponds to applying bounded creation operators to feature vectors. This…

泛函分析 · 数学 2025-11-18 James Tian

Let $\pi: X \to Y$ be a morphism of projective varieties and consider the pushforward map $\pi_*: N_k(X) \to N_k(Y)$ of numerical cycle classes. We show that when the Chow groups of points of the fibers are as simple as they can be, then…

代数几何 · 数学 2016-01-14 Mihai Fulger , Brian Lehmann

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such…

组合数学 · 数学 2017-07-12 Yan-Quan Feng , Istvan Kovacs , Da-Wei Yang

The paper concerns the analysis of global minimizers of a Dirichlet-type energy functional in the class of $\mathbb{S}^2$-valued maps defined in cylindrical surfaces. The model naturally arises as a curved thin-film limit in the theories of…

偏微分方程分析 · 数学 2022-10-11 Giovanni Di Fratta , Alberto Fiorenza , Valeriy Slastikov

Given an undirected graph $G$ and a multiset of $k$ terminal pairs $\mathcal{X}$, the Vertex-Disjoint Paths (\VDP) and Edge-Disjoint Paths (\EDP) problems ask whether $G$ has $k$ pairwise internally vertex-disjoint paths and $k$ pairwise…

数据结构与算法 · 计算机科学 2023-10-02 Juhi Chaudhary , Harmender Gahlawat , Michal Włodarczyk , Meirav Zehavi

Let $p$ be an odd prime, and $D_{2p}=\langle a,b\mid a^p=b^2=1,bab=a^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we completely classify the cubic Cayley graphs on $D_{2p}$ up to isomorphism by means of spectral method. By…

组合数学 · 数学 2017-08-29 Xueyi Huang , Qiongxiang Huang , Lu Lu

In a digraph, a quasi-kernel is a subset of vertices that is independent and such that every vertex can reach some vertex in that set via a directed path of length at most two. Whereas Chv\'atal and Lov\'asz proved in 1974 that every…

离散数学 · 计算机科学 2021-07-09 Hélène Langlois , Frédéric Meunier , Romeo Rizzi , Stéphane Vialette

All hyperK\"ahler ALE 4-manifolds with a given non-trivial finite group $\Gamma$ in $SU(2)$ at infinity are parameterized by an open dense subset of a real linear space of dimension $3$rank$\Phi$. Here, $\Phi$ denotes the root system…

微分几何 · 数学 2025-07-16 Yuanjiu Lyu , Bin Xu

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…

离散数学 · 计算机科学 2018-01-09 Adèle Pass-Lanneau , Ayumi Igarashi , Frédéric Meunier

We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree $d$. We completely determine the asymptotic behaviour…

组合数学 · 数学 2015-02-17 Grahame Erskine

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

组合数学 · 数学 2023-03-02 Daniel R. Hawtin , Jin-Xin Zhou , Cheryl E. Praeger

The orthogonality dimension of a graph over $\mathbb{R}$ is the smallest integer $d$ for which one can assign to every vertex a nonzero vector in $\mathbb{R}^d$ such that every two adjacent vertices receive orthogonal vectors. For an…

数据结构与算法 · 计算机科学 2024-08-19 Ishay Haviv , Dror Rabinovich

For every odd prime power $q$, a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order $q^3$ is constructed. It is proved that these…

组合数学 · 数学 2024-11-11 Mikhail Muzychuk , Grigory Ryabov