Panconnectivity
id:
panconnectivity-189-8651789
title:
Panconnectivity
text:
In graph theory, a panconnected graph is an undirected graph in which, for every two vertices s and t, there exist paths from s to t of every possible length from the distance d(s,t) up to n − 1, where n is the number of vertices in the graph. The concept of panconnectivity was introduced in 1975 by Yousef Alavi and James E. Williamson. Panconnected graphs are necessarily pancyclic: if uv is an edge, then it belongs to a cycle of every possible length, and therefore the graph contains a cycle of
brand slug:
wiki
category slug:
encyclopedia
description:
Graph with all path lengths between each two vertices
original url:
https://en.wikipedia.org/wiki/Panconnectivity
date created:
2010-10-25T07:09:56Z
date modified:
2024-09-09T10:55:48Z
main entity:
{"identifier":"Q7130383","url":"https://www.wikidata.org/entity/Q7130383"}
image:
fields total:
13
integrity:
15