惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

S
SegmentFault 最新的问题
G
Google Developers Blog
H
Help Net Security
月光博客
月光博客
阮一峰的网络日志
阮一峰的网络日志
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
P
Proofpoint News Feed
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
B
Blog RSS Feed
爱范儿
爱范儿
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 三生石上(FineUI控件)
大猫的无限游戏
大猫的无限游戏
人人都是产品经理
人人都是产品经理
GbyAI
GbyAI
D
Docker
Hugging Face - Blog
Hugging Face - Blog
I
InfoQ
博客园 - 司徒正美
Last Week in AI
Last Week in AI
Microsoft Security Blog
Microsoft Security Blog
美团技术团队
Stack Overflow Blog
Stack Overflow Blog
M
MIT News - Artificial intelligence

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Finite $s$-geodesic-transitive digraphs
Wei Jin · 2023-03-14 · via math.CO updates on arXiv.org

This paper initiates the investigation of the family of $(G,s)$-geodesic-transitive digraphs with $s\geq 2$. We first give a global analysis by providing a reduction result. Let $Γ$ be such a digraph and let $N$ be a normal subgroup of $G$ maximal with respect to having at least $3$ orbits. Then the quotient digraph $Γ_N$ is $(G/N,s')$-geodesic-transitive where $s'=\min\{s,\diam(Γ_N)\}$, $G/N$ is either quasiprimitive or bi-quasiprimitive on $V(Γ_N)$, and $Γ_N$ is either directed or an undirected complete graph. Moreover, it is further shown that if $Γ$ is not $(G,2)$-arc-transitive, then $G/N$ is quasiprimitive on $V(Γ_N)$. On the other hand, we also consider the case that the normal subgroup $N$ of $G$ has one orbit on the vertex set. We show that if $N$ is regular on $V(Γ)$, then $Γ$ is a circuit, and particularly each $(G,s)$-geodesic-transitive normal Cayley digraph with $s\geq 2$, is a circuit. Finally, we investigate $(G,2)$-geodesic-transitive digraphs with either valency at most 5 or diameter at most 2. Let $Γ$ be a $(G,2)$-geodesic-transitive digraph. It is proved that: if $Γ$ has valency at most $5$, then $Γ$ is $(G,2)$-arc-transitive; if $Γ$ has diameter $2$, then $Γ$ is a balanced incomplete block design with the Hadamard parameters.