%0 Journal Article
%T Vertex capacity in a graph structure
%A R.B. Gnana Jothi
%A R. Ezhil Mary
%J International Journal of Mathematics and Soft Computing
%D 2013
%I SweDha Publication
%X In a graph structure G = (V, E1, E2¡­ Ek), the capacity of a vertex c(v) is the number of different Ei edges incident at v. In this paper, we have made an attempt to answer the problem of examining the graph structures for which sum of vertex capacities is equal to sum of number of relations and the number of edges in the structure for some families of graphs viewed as graph structures.
%K Graph structure
%K Ei ¨C connected
%K Ei ¨Cedges
%K Ei-path
%K capacity of a vertex
%K k-edge colorable
%K k-edge chromatic
%K edge chromatic partition
%K matching.
%U http://ijmsc.com/index.php/ijmsc/article/view/190/pdf_24