2 citations · 2 across the 6 of their papers we have counts for
13 papers
Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
A. C. Burgess, P. Danziger, A. Pastine +1
In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group . When is cyclic, these types of matrices have been widely used to build uniform…
On the rank of the distance matrix of graphs
Ezequiel Dratman, Luciano N. Grippo, Verónica Moyano +1
Let be a connected graph with . The -entry of the distance matrix of is the distance between and . In this article, using…
2-switch transition on unicyclic graphs and pseudoforest
Daniel A. Jaume, Adrián Pastine, Victor Schvöllner
In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into t…
On Stars in Caterpillars and Lobsters
Emiliano J. J. Estrugo, Adrián Pastine
The family of all -independent sets of a graph containing a fixed vertex is called a {star} and is called its center. Stars are interesting for their relation to Erdös-K…
2-switch: transition and stability on graphs and forests
Daniel A. Jaume, Adrián Pastine, Victor Nicolas Schvöllner
Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the…
Sequencing Partial Steiner Triple Systems
Brian Alspach, Donald L. Kreher, Adrián Pastine
A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point…