Conditional Diameter
Conditional Diameter is a metric in graph theory that quantifies the maximum shortest-path distance between any two vertices in a network under a specified connectivity condition, distinguishing it from standard diameter by incorporating constraints on vertex adjacency or edge availability.
9
Publications
244
Citations
23
Authors
9
Institutions
Publications per year
2017–2026
0
Parents
9
On distribution function of the diameter in uncertain graph
Yuan Gao, Lixing Yang, Shukai Li et al. · Information Sciences · 2014 · 64 citations
On the connectivity and the conditional diameter of graphs and digraphs
C. Balbuena, J. F�brega, M.A. Fiol · Networks · 1996 · 24 citations
C. Balbuena, M. Cera, A. Diánez et al. · Information Processing Letters · 2005 · 19 citations
1–5 of 9
23
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 23
9
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
10 publications
176 citations
University of Nevada, Las Vegas
Las Vegas, United States
1 h-index
1 publications
59 citations
National Institute of Technology Durgapur
Durgapur, India
1 h-index
1 publications
64 citations
Shanxi University
Taiyuan, China
1 h-index
2 publications
22 citations
Beijing Jiaotong University
Beijing, China
1 h-index
3 publications
192 citations
National Defense University
Taoyuan City, Taiwan
1 h-index
2 publications
28 citations

Universidad Carlos III de Madrid
Madrid, Spain
1 h-index
2 publications
46 citations

Universidad de Sevilla
Seville, Spain
1 h-index
3 publications
57 citations
1–8 of 9
4 publications · 65 citations
4
h-index
2 publications · 73 citations
2
h-index
1 publications · 19 citations
1
h-index
1 publications · 64 citations
1
h-index
Repository · 1 publications · 23 citations
1
h-index
1–5