Panconnectivity
Summary
In graph theory, a panconnected graph is an undirected graph in which, for every two vertices and , there exist paths from to of every possible length from the distance up to , where is the number of vertices in the graph. The concept of panconnectivity was introduced in 1975 by Yousef Alavi and James E. Williamson.
Further reading
- Wikipedia, page 29341653, revision 1315797886, Panconnectivity. adopted
About this page
| Tag | EMA9RK71GZ |
|---|---|
| URI | m2://EMA9RK71GZ |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.