全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Vertex capacity in a graph structure

Keywords: Graph structure , Ei – connected , Ei –edges , Ei-path , capacity of a vertex , k-edge colorable , k-edge chromatic , edge chromatic partition , matching.

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133