The Edge C4 Graph of a Graph

Dyuthi/Manakin Repository

The Edge C4 Graph of a Graph

Show full item record

Title: The Edge C4 Graph of a Graph
Author: MANJU, K. MENON; vijayakumar, A
Abstract: Abstract. The edge C4 graph E4(G) of a graph G has all the edges of Gas its vertices, two vertices in E4(G) are adjacent if their corresponding edges in G are either incident or are opposite edges of some C4. In this paper, characterizations for E4(G) being connected, complete, bipartite, tree etc are given. We have also proved that E4(G) has no forbidden subgraph characterization. Some dynamical behaviour such as convergence, mortality and touching number are also studied
URI: http://dyuthi.cusat.ac.in/purl/1534
Date: 2010-02-04


Files in this item

Files Size Format View
the edge C4 graph of a graph.PDF 2.145Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search Dyuthi


Advanced Search

Browse

My Account