首页    期刊浏览 2024年09月22日 星期日
登录注册

文章基本信息

  • 标题:Matching and Coloring in Topologized Bipartite Graph
  • 本地全文:下载
  • 作者:S. Vimala ; S. Kalpana
  • 期刊名称:International Journal of Innovative Research in Science, Engineering and Technology
  • 印刷版ISSN:2347-6710
  • 电子版ISSN:2319-8753
  • 出版年度:2017
  • 卷号:6
  • 期号:4
  • 页码:7079
  • DOI:10.15680/IJIRSET.2017.0604220
  • 出版社:S&S Publications
  • 摘要:Let G be bipartite graph with V vertices and E edges. A topological space X is a topologized graph if itsatisfies the following conditions: Every singleton is open or closed. ∀􀝔 ∈ 􀜺, ∣ 􀟲(􀝔) ∣≤ 2, where 􀟲(􀝔) is a boundary of x.Here the topology is defined on the graph, since the space X is the union of vertices and edges. This work is extendedfrom topologized graph to Bipartite graph, Matching, maximum matching, Perfect matching, vertex coloring and edgecoloring.
  • 关键词:Topology; Topologized graph; labeling; Bipartite graph; Matching graph; Coloring graph
国家哲学社会科学文献中心版权所有