Two Graphs with a Common Edge
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 det A(G) of the adjacency matrix of G by r...
Main Author: | Badura Lidia |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2014-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1745 |
Similar Items
-
Determinants of adjacency matrices of graphs
by: Alireza Abdollahi
Published: (2012-12-01) -
Characterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic
by: Muhammad Javaid
Published: (2017-03-01) -
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
by: E. Ghasemian, et al.
Published: (2018-09-01) -
Zeta functions from graphs
by: Simon Davis
Published: (2018-08-01) -
Path Partition in Directed Graph – Modeling and Optimization
by: Issam Abdel Kader
Published: (2013-03-01)