On local connectivity of graphs (Q2472822): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.aml.2006.12.014 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978500105 / rank | |||
Normal rank |
Revision as of 00:52, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On local connectivity of graphs |
scientific article |
Statements
On local connectivity of graphs (English)
0 references
25 February 2008
0 references
The local connectivity \(k(u,v)\) between two distinct vertices \(u\) and \(v\) of a graph \(G\) is the maximum number of internally disjoint paths between \(u\) and \(v\) in \(G\). Let \(d(x)\) be the degree of a vertex \(x\). A graph \(G\) is maximally locally connected when \(k(u,v) = \min(d(u), d(v))\) for all pairs of \(u\) and \(v\) in \(G\). The author establishes a sufficient condition for equality of the connectivity and the minimum degree of a \(p\)-partite maximally locally connected graph.
0 references
connectivity
0 references
local connectivity
0 references
minimum degree
0 references
\(p\)-partite graph
0 references