Vol. 33, No. 1, 1970

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 330: 1
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Vol. 324: 1  2
Vol. 323: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN: 1945-5844 (e-only)
ISSN: 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Existence of triconnected graphs with prescribed degrees

Siddani Bhaskara Rao and Ayyagari Ramachandra Rao

Vol. 33 (1970), No. 1, 203–207
Abstract

Necessary and sufficient conditions for the existence of a p-connected (linear undirected) graph with prescribed degrees d1,d2,,dn are known for p = 1,2. In this paper we solve this problem for p = 3.

Mathematical Subject Classification
Primary: 05.50
Milestones
Received: 13 August 1969
Published: 1 April 1970
Authors
Siddani Bhaskara Rao
Ayyagari Ramachandra Rao