Displaying similar documents to “Co prime path decomposition number of a graph.”

Toughness of K a , t -minor-free graphs.

Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A Note on the Seven Bridges of Königsberg Problem

Adam Naumowicz (2014)

Formalized Mathematics

Similarity:

In this paper we account for the formalization of the seven bridges of Königsberg puzzle. The problem originally posed and solved by Euler in 1735 is historically notable for having laid the foundations of graph theory, cf. [7]. Our formalization utilizes a simple set-theoretical graph representation with four distinct sets for the graph’s vertices and another seven sets that represent the edges (bridges). The work appends the article by Nakamura and Rudnicki [10] by introducing the...

A formula for all minors of the adjacency matrix and an application

R. B. Bapat, A. K. Lal, S. Pati (2014)

Special Matrices

Similarity:

We supply a combinatorial description of any minor of the adjacency matrix of a graph. This description is then used to give a formula for the determinant and inverse of the adjacency matrix, A(G), of a graph G, whenever A(G) is invertible, where G is formed by replacing the edges of a tree by path bundles.