Now showing items 1-2 of 2
| 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 |
| Files | Size |
|---|---|
| the edge C4 graph of a graph.PDF | (2.249Mb) |
| Abstract: | this paper, the median and the antimedian of cographs are discussed. It is shown that if G, and G2 are any two cographs, then there is a cograph that is both Eulerian and Hamiltonian having Gl as its median and G2 as its antimedian. Moreover, the connected planar and outer planar cographs are characterized and the median and antimedian graphs of connected, planar cographs are listed. |
| URI: | http://dyuthi.cusat.ac.in/purl/1536 |
| Files | Size |
|---|---|
| On the median and the antimedian of a cograph.PDF | (2.692Mb) |
Now showing items 1-2 of 2
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.