Premium
Note on the vertex 2–connectivity of a graph
Author(s) -
Marcu Dănuţ
Publication year - 1988
Publication title -
mathematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.955
H-Index - 29
eISSN - 2041-7942
pISSN - 0025-5793
DOI - 10.1112/s0025579300006288
Subject(s) - mathematics , combinatorics , vertex (graph theory) , graph , connectivity , vertex connectivity , spanning tree , block (permutation group theory) , discrete mathematics
Summary In this paper we show that every finite connected graph G = ( V , E ), without loops and for which its spanning trees are the blocks of a balanced incomplete block design on E containing more than one block ( E is the set of edges), is vertex 2–connected.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom