Back to Search
Start Over
TWO GRAPHS WITH A COMMON EDGE.
- Source :
-
Discussiones Mathematicae: Graph Theory . 2014, Vol. 34 Issue 3, p497-507. 11p. - Publication Year :
- 2014
-
Abstract
- Let G = G1 ∪ G2 be the sum of two simple graphs G1, G2 having a common edge or G = G1 ∪ e1 ∪ e2 ∪ G2 be the sum of two simple disjoint graphs G1,G2 connected by two edges e1 and e2 which form a cycle C4 inside G. We give a method of computing the determinant detA(G) of the adjacency matrix of G by reducing the calculation of the determinant to certain subgraphs of G1 and G2. To show the scope and effectiveness of our method we give some examples [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 12343099
- Volume :
- 34
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Discussiones Mathematicae: Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 97078055
- Full Text :
- https://doi.org/10.7151/dmgt.1745