THE PRIMITIVE GRAPHS WITH  ODD GIRTH   s

您当前的位置：

首页 >

文章列表页 >

THE PRIMITIVE GRAPHS WITH ODD GIRTH s

更新时间：2026-09-14

本文证明了一类ｎ阶本原无向图有指数ｓ－１的一个充分必要条件，其中ｓ为图的围长

In this paper

we prove a sufficient and necessary condition for a primitive graph G to have exponent s-1 where s is odd girth of the graph G.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The Generalized Competition Indices of Some Extremal Digraphs in Scrambling Indices of Primitive Digraphs

Primitive Exponents of a Class of Two-Colored Digraphs

THE UPPER BOUND FOR THE EXPONENT SET OF PRIMITIVE DIAGRAPH WITH n≤2d－4

Exponents of a Class of Three-Colored Digraphs with Odd Vertices

Primitive Exponents of a Class of Two-Colored Digraphs with Two Cycles

Related Author

孙晓玲

邵燕灵

杜建伟

高玉斌

罗美金

王建中

雷英杰

王玉香

Related Institution

1:中北大学理学院 2:中北大学理学院 3:中北大学理学院山西太原030051 4

1:中北大学理学院

⁰