Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths

Zejun Huang; Xingzhi Zhan

doi:10.1016/j.disc.2012.04.008

Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths

Zejun Huang
, Xingzhi Zhan^*

^*此作品的通讯作者

数学科学学院

East China Normal University

科研成果: 期刊稿件 › 文章 › 同行评审

8 引用（Scopus）

摘要

Let D be a digraph of order n in which any two walks with the same initial vertex and the same terminal vertex have distinct lengths. We prove that D has at most ( ⁿ⁺¹⁾²4 arcs if n is odd and n(n+2)4 arcs if n is even. The digraphs attaining this maximum size are determined.

源语言	英语
页（从-至）	2203-2213
页数	11
期刊	Discrete Mathematics
卷	312
期	15
DOI	https://doi.org/10.1016/j.disc.2012.04.008
出版状态	已出版 - 6 8月 2012

访问文件

10.1016/j.disc.2012.04.008

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{dfe4c9de4b12443b8b55f745bf393f5a,

title = "Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths",

abstract = "Let D be a digraph of order n in which any two walks with the same initial vertex and the same terminal vertex have distinct lengths. We prove that D has at most ( n+1)24 arcs if n is odd and n(n+2)4 arcs if n is even. The digraphs attaining this maximum size are determined.",

keywords = "0-1 matrix, Digraph, Extremal digraph, Walk",

author = "Zejun Huang and Xingzhi Zhan",

year = "2012",

month = aug,

day = "6",

doi = "10.1016/j.disc.2012.04.008",

language = "英语",

volume = "312",

pages = "2203--2213",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "15",

}

TY - JOUR

T1 - Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths

AU - Huang, Zejun

AU - Zhan, Xingzhi

PY - 2012/8/6

Y1 - 2012/8/6

N2 - Let D be a digraph of order n in which any two walks with the same initial vertex and the same terminal vertex have distinct lengths. We prove that D has at most ( n+1)24 arcs if n is odd and n(n+2)4 arcs if n is even. The digraphs attaining this maximum size are determined.

AB - Let D be a digraph of order n in which any two walks with the same initial vertex and the same terminal vertex have distinct lengths. We prove that D has at most ( n+1)24 arcs if n is odd and n(n+2)4 arcs if n is even. The digraphs attaining this maximum size are determined.

KW - 0-1 matrix

KW - Digraph

KW - Extremal digraph

KW - Walk

UR - https://www.scopus.com/pages/publications/84860652390

U2 - 10.1016/j.disc.2012.04.008

DO - 10.1016/j.disc.2012.04.008

M3 - 文章

AN - SCOPUS:84860652390

SN - 0012-365X

VL - 312

SP - 2203

EP - 2213

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 15

ER -

Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths

摘要

访问文件

其它文件与链接

指纹

引用此