An extension of the exponential formula in enumerative combinatorics.
In this short note we provide an extension of the notion of Hessenberg matrix and observe an identity between the determinant and the permanent of such matrices. The celebrated identity due to Gibson involving Hessenberg matrices is consequently generalized.
For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least t; (b) w(xz) = w(yz) for every vertex z ∈ N(x) ∩ N(y) with xy /∈ E(G); (c) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains...
We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.