John, Teena Liza and Varkey, T. K. Mathew (2021) The Definition of Bimean Graphs. In: Current Topics on Mathematics and Computer Science Vol. 5. B P International, pp. 112-119. ISBN 978-93-91473-38-9
Full text not available from this repository.Abstract
Let G be a(p,q) graph and let: V(G) {0,1,2,…..,q} be an injection. The graph G is said to be a mean graph if for each edge there exists an induced map defined by , if is even or , if is odd. The line graph of G is a graph in which the vertices are the edges (lines) of G and the two points of L(G) are adjacent whenever the corresponding lines of G are adjacent. In this chapter, we investigate the meanness of both G and L(G) and thus introduce the definition of bimean graphs.
| Item Type: | Book Section |
|---|---|
| Subjects: | Library Keep > Computer Science |
| Depositing User: | Unnamed user with email support@librarykeep.com |
| Date Deposited: | 17 Nov 2023 04:26 |
| Last Modified: | 17 Nov 2023 04:26 |
| URI: | http://archive.jibiology.com/id/eprint/1714 |
Actions (login required)
- View Item