Affordable Access

Publisher Website

Graphs and digraphs with given girth and connectivity

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Volume
132
Identifiers
DOI: 10.1016/0012-365x(92)00576-d

Abstract

Abstract In this paper, we show that for any given two positive integers g and k with g⩾3, there exists a graph (digraph) G with girth g and connectivity k. Applying this result, we give a negative answer to the problem proposed by M. Junger, G. Reinelt and W.R. Pulleyblank (1985).

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Connectivity of graphs with given girth pair

on Discrete Mathematics Jan 01, 2007

On the restricted connectivity and superconnectivi...

on Discrete Mathematics Jan 01, 2007

On the order of graphs with a given girth pair

on Discrete Mathematics Apr 28, 2014
More articles like this..