• Publications
  • Influence
Alternating cycles in edge-partitioned graphs
We show that if edges of a 2-connected graph G are partitioned into two classes so that every vertex is incident with edges from both classes, then G has an alternating cycle. Expand
  • 49
  • 9
A portion of the well-known collaboration graph
The collaboration graph C has as vertices all researchers (mathematicians, in particular), with an edge joining every pair of authors of a multi-author paper if u and v have published a joint research paper. Expand
  • 96
  • 7
  • PDF
Famous trails to Paul Erdős
The notion of Erd} os number has oated around the mathematical research community for more than thirty years, as a way to quantify the common knowledge that mathematical and scientiic research has become a very collaborative process in the twentieth century, not an activity engaged in solely by isolated individuals. Expand
  • 104
  • 6
On weakly connected domination in graphs
A dominating set D is a weakly connected dominating set of a connected graph G if (V,E@?(DxV)) is connected. Expand
  • 67
  • 6
The evolution of the mathematical research collaboration graph
We discuss some properties of the research collaboration graph for mathematicians, look at its evolution over time, and survey some random models that might produce graphs of this sort. Expand
  • 103
  • 5
  • PDF
Small Worlds: The Dynamics of Networks between Order and Randomness. By Duncan J. Watts
Small Worlds: The Dynamics of Networks between Order and Randomness. Expand
  • 25
  • 5
Generalized matrix tree theorem for mixed graphs
In this article we provide a combinatorial description of an arbitrary minor of the Laplacian matrix (L) of a mixed graph (a graph with some oriented and some unoriented edges). This is a generalizedExpand
  • 60
  • 5
  • PDF
On the minors of an incidence matrix and its Smith normal form
Abstract Consider the vertex-edge incidence matrix of an arbitrary undirected, loopless graph. We completely determine the possible minors of such a matrix. These depend on the maximum number ofExpand
  • 47
  • 3
Algebraic graph theory without orientation
Abstract Let G be an undirected graph with vertices {v 1 ,v 2 ,…,>;v ⋎ } and edges {e1,e2, …,eϵ}. Let M be the ⋎ × ϵ matrix whose ijth entry is 1 if ej is a link incident with vi, 2 if ej is a loopExpand
  • 39
  • 2
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids
We characterize the graphs and matroids G for which γ(G) = η(G). Expand
  • 64
  • 1