23 citations · 59 across the 19 of their papers we have counts for
19 papers · 1 filter
Graphs with the same truncated cycle matroid
Jose De Jesus, Alexander Kelmans
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same trunc…
On the Quotient-Lift Matroid Relation
Jose De Jesus, Alexander Kelmans
It is well known that a matroid L is a lift of a matroid M if and only if every circuit of L is the union of some circuits of M. In this paper we give a simpler proof of this impor…
ON -GRAPHS
Rafael Aparicio, Alexander Kelmans
Let be a graph and a non-negative integer. A graph is called a -{\em graph} if is neither a complete graph no an edge-empty graph, …
Spectra of Digraph Transformations
Aiping Deng, Alexander Kelmans
For a digraph D and three parameters x, y, z in {0,1,+,-} we define the digraph D^(x,y,z) and call it the (x,y,z)-transformation of D. We show that for every r-regular digraph D th…
Laplacian Spectra of Regular Graph Transformations
Aiping Deng, Alexander Kelmans, Juan Meng
For any given graph G = (V,E) we define in a certain way a new graph G(x,y,z) with the vertex set V\cup E depending on parameters x,y,z from {0,1, +, -} and call graph G(x,y,z) the…
On graphs uniquely defined by their -circular matroids
José F. De Jesús, Alexander Kelmans
In 30's Hassler Whitney considered and completely solved the problem of describing the classes of graphs having the same cycle matroid . A natural analog o…