SECTION OF MATHEMATICS: THE UNIQUENESS OF g(2,2,10,56)*
SECTION OF MATHEMATICS: THE UNIQUENESS OF g(2,2,10,56)*
复制标题
数学部分：g(2,2,10,56)* 的唯一性
DOI：
10.1111/j.2164-0947.1969.tb01990.x
复制
发表时间：
1969
期刊：
影响因子：
--
通讯作者：
A. Gewirtz
中科院分区：
文献类型：
--
作者：
A. Gewirtz
参考文献简介1，我们研究了直径为d>；1，围长为2d的简单无向图的G类，使得对于任意的G，如果一对结点彼此之间的距离为d，则这对结点是由t条不同的长为d，t>；1的路连接起来的。2.文献[1]考虑了二部图的子类B_c_G。3.文献[1]中图的一个应用。2对传输网络的影响见文献[1]。4，并且可以很容易地将相同的概念修改为适用于文献[4]中的图。1.
INTRODUCTION In Ref. 1, we examined the class G of simpleundirected graphs of diameter d> 1, girth 2d and such that for any g E G, if a pair of nodes are at distance d from each other, then that pair of nodes is connected by t distinct paths of length d, t> 1.Related problems dealing with graphs of diameter d and girth 2d+ 1 were considered in Ref. 2. The subclass B c G of bipartite graphs was considered in Ref. 3. An application of the graphs in Ref. 2 to transmission networks was given in Ref. 4, and the same concept can be easily modified to apply to the graphs of Ref. 1.