摘要
讨论了一种3度正则网络,这类网络具有较小的网络直径,本文给出了网络直径、网络支撑树和欧拉环游的数目的公式。
A kind of 3-regular digraphy network model is discussed in this paper, the diameter of this model is shorter than others. The diameter, the number of Eulerian tours and spanning trees of this type of networks are deduced.
出处
《数学研究》
CSCD
2003年第3期297-300,共4页
Journal of Mathematical Study
基金
漳州师院自然科学基金(SK02014)