摘要
本文讨论了2-重自补图和有向自补图的连通性以及2-重自补图的直径,同时以自补置换作为工具研究了当2-重自补图或有向自补图被分成两个连通分支后,这两个连通分支之间的边数与顶点数之间的关系.
In the paper, the connectivity and diameters of serf-complementary 2-multigraphs and serf-complementary digraphs are discussed, and if these graphs get disrupted, the relations for the number of edges and vertices between the two connected components are also studied by serf-complementary permutation.
出处
《山西师范大学学报（自然科学版）》
2007年第1期10-12,共3页
Journal of Shanxi Normal University(Natural Science Edition)
基金
南京信息工程大学科研启动基金资助项目(QD12)
关键词
2-重自补图
有向自补图
自补置换
度向量序列
serf-complementary 2-multigraphs
serf-complementary digraphs
serf-complementary permutation
degree sequence
