Vertex capacity in a graph structure
Journal: International Journal of Mathematics and Soft Computing (Vol.3, No. 2)Publication Date: 2013-05-28
Authors : R.B. Gnana Jothi R. Ezhil Mary;
Page : 37-40
Keywords : Graph structure; Ei ? connected; Ei ?edges; Ei-path; capacity of a vertex; k-edge colorable; k-edge chromatic; edge chromatic partition; matching.;
Abstract
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.
Other Latest Articles
Last modified: 2013-08-24 12:30:35