Lower bound for the connectivity of directed Euler tour transformation graphs

被引：0

|

作者：

Li, X.

机构：

来源：

Discrete Mathematics | 1997年 / 163卷 / 1-3期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] A lower bound for the connectivity of directed Euler tour transformation graphs
Li, XL
DISCRETE MATHEMATICS, 1997, 163 (1-3) : 101 - 108
[2] HAMILTON CYCLES IN DIRECTED EULER TOUR GRAPHS
ZHANG, FJ
GUO, XF
DISCRETE MATHEMATICS, 1987, 64 (2-3) : 289 - 298
[3] LOWER BOUND OF CONNECTIVITY IN CIRCULAR GRAPHS
ZHOU, YS
LI, TF
CHINESE SCIENCE BULLETIN, 1991, 36 (18): : 1579 - 1579
[4] LOWER BOUND OF CONNECTIVITY IN CIRCULAR GRAPHS
周永生
李唐芬
ChineseScienceBulletin, 1991, (18) : 1579 - 1579
[5] On a Lower Bound for the Eccentric Connectivity Index of Graphs
Bantva, Devsi
ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018, 2018, 10743 : 179 - 187
[6] The sharpness of a lower bound on the algebraic connectivity for maximal graphs
Kirkland, SJ
Molitierno, JJ
Neumann, M
LINEAR & MULTILINEAR ALGEBRA, 2001, 48 (03): : 237 - 246
[7] Sparsification lower bound for linear spanners in directed graphs
Tale, Prafullkumar
THEORETICAL COMPUTER SCIENCE, 2022, 898 : 69 - 74
[8] A LOWER BOUND FOR THE STEINER TREE PROBLEM IN DIRECTED-GRAPHS
LIU, WG
NETWORKS, 1990, 20 (06) : 765 - 778
[9] A LOWER BOUND FOR THE SHORTEST HAMILTONIAN PATH IN DIRECTED-GRAPHS
MACULAN, N
SALLES, JJC
OR SPEKTRUM, 1991, 13 (02) : 99 - 102
[10] Algebraic connectivity of directed graphs
Wu, CW
LINEAR & MULTILINEAR ALGEBRA, 2005, 53 (03): : 203 - 223

← 1 2 3 4 5 →