The mincut graph of a graph

In this paper we introduce an intersection graph of a graph $G$, with vertex set the minimum edge-cuts of $G$. We find the minimum cut-set graphs of some well-known families of graphs and show that every graph is a minimum cut-set graph, henceforth called a \emph{mincut graph}. Furthermore, we show that non-isomorphic graphs can have isomorphic mincut graphs and ask the question whether there are sufficient conditions for two graphs to have isomorphic mincut graphs. We introduce the $r$-intersection number of a graph $G$, the smallest number of elements we need in $S$ in order to have a family $F=\{S_1, S_2 \ldots , S_i\}$ of subsets, such that $|S_i|=r$ for each subset. Finally we investigate the effect of certain graph operations on the mincut graphs of some families of graphs

A Study on Edge-Set Graphs of Certain Graphs

Let $G(V, E)$ be a simple connected graph, with $|E| = \epsilon.$ In this paper, we define an edge-set graph $\mathcal G_G$ constructed from the graph $G$ such that any vertex $v_{s,i}$ of $\mathcal G_G$ corresponds to the $i$-th $s$-element subset of $E(G)$ and any two vertices $v_{s,i}, v_{k,m}$ of $\mathcal G_G$ are adjacent if and only if there is at least one edge in the edge-subset corresponding to $v_{s,i}$ which is adjacent to at least one edge in the edge-subset corresponding to $v_{k,m}$ where $s,k$ are positive integers. It can be noted that the edge-set graph $\mathcal G_G$ of a graph $G$ id dependent on both the structure of $G$ as well as the number of edges $\epsilon.$ We also discuss the characteristics and properties of the edge-set graphs corresponding to certain standard graphs.Comment: 10 pages, 2 figure