Bipartite graphs and digraphs with maximum connectivity
نویسندگان
چکیده
منابع مشابه
Bipartite Graphs and Digraphs with Maximum Connectivity
Recently, some sufficient conditions for a digraph to have maximum connectivity or high superconnectivity have been given in terms of a new parameter which can be thought of as a generalization of the girth of a graph. In this paper similar results are derived for bipartite digraphs and graphs showing that, in this case, all the known conditions can be improved. As a corollary, it is shown that...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملOn the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs
In this work, first, we present sufficient conditions for a bipartite digraph to attain optimum values of a stronger measure of connectivity, the so-called superconnectivity. To be more precise, we study the problem of disconnecting a maximally connected bipartite (di)graph by removing nontrivial subsets of vertices or edges. Within this framework, both an upper-bound on the diameter and Chartr...
متن کاملReadability of digraphs and bipartite graphs
In the final project paper we consider a graph parameter called readability. Motivation for readability comes from bioinformatics applications. Graphs arising in problems related to genome sequencing are of small readability, which motivates the study of graphs of small readability. We present an algorithm due to Braga and Meidanis, which shows that every digraph is isomorphic to the overlap gr...
متن کاملSuperconnectivity of bipartite digraphs and graphs
A maximally connected digraph G is said to be super-κ if all its minimum disconnecting sets are trivial. Analogously, G is called super-λ if it is maximally arcconnected and all its minimum arc-disconnecting sets are trivial. It is first proved that any bipartite digraph G with diameter D is super-κ if D ≤ 2` − 1, and it is super-λ if D ≤ 2`, where ` denotes a parameter related to the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00097-b