On the connectivity of cayley graphs

Wilfried Imrich

doi:10.1016/0095-8956(79)90007-8

On the connectivity of cayley graphs

Wilfried Imrich

Lehrstuhl für Angewandte Mathematik (170)

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Begutachtung

12 Zitate (Scopus)

Abstract

It has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff.

Originalsprache	Englisch
Seiten (von - bis)	323-326
Seitenumfang	4
Fachzeitschrift	Journal of Combinatorial Theory, Series B
Jahrgang	26.1979
Ausgabenummer	3
DOIs	https://doi.org/10.1016/0095-8956(79)90007-8
Publikationsstatus	Veröffentlicht - Juni 1979

Zugriff auf Dokument

10.1016/0095-8956(79)90007-8

Andere Dateien und Links

Link to publication in Scopus

Dieses zitieren

@article{21e5c0dc7b4d4a1fb1ae011f8eaa6736,

title = "On the connectivity of cayley graphs",

abstract = "It has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff.",

author = "Wilfried Imrich",

year = "1979",

month = jun,

doi = "10.1016/0095-8956(79)90007-8",

language = "English",

volume = "26.1979",

pages = "323--326",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - On the connectivity of cayley graphs

AU - Imrich, Wilfried

PY - 1979/6

Y1 - 1979/6

N2 - It has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff.

AB - It has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff.

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

U2 - 10.1016/0095-8956(79)90007-8

DO - 10.1016/0095-8956(79)90007-8

M3 - Article

AN - SCOPUS:0039039198

SN - 0095-8956

VL - 26.1979

SP - 323

EP - 326

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 3

ER -