Scholarlink

For a graph G (V, E), we describe anti − duplication of a \( vertex \) m in G by adding a new vèrtéx m′ in G′ such that \( {N}_{\left\{{G}^{\prime}\right\}}\left({m}^{\prime}\right)={\left[{N}_G(m)\right]}^c. \) A vèrtéx m ∈ V(G) is a self − vèrtéx switiching of G if G ≅ G{m}, where G{m} is the graph obtained by deleting all edges of G incident to m and adding all edges incident to m which are not in G. In this chapter, we define anti − duplication self − vèrtéx switiching of a graph and study its properties.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Some Results on Anti-duplication Self-Vèrtèx Switchings

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • M. Ashwin Shijo,
  • C. Jayasekaran

摘要

For a graph G (V, E), we describe anti − duplication of a \( vertex \) m in G by adding a new vèrtéx m′ in G′ such that \( {N}_{\left\{{G}^{\prime}\right\}}\left({m}^{\prime}\right)={\left[{N}_G(m)\right]}^c. \) A vèrtéx m ∈ V(G) is a self − vèrtéx switiching of G if G ≅ G{m}, where G{m} is the graph obtained by deleting all edges of G incident to m and adding all edges incident to m which are not in G. In this chapter, we define anti − duplication self − vèrtéx switiching of a graph and study its properties.