547 search results - page 54 / 110 » dm 2008 |
111
Voted
DM
2007
15 years 1 months ago
2007
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
105
Voted
DM
2007
15 years 1 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
DM
2007
15 years 1 months ago
2007
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
105
click to vote
DM
2007
15 years 1 months ago
2007
We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We al...
DM
2000
15 years 25 days ago
2000
Let a be a vector of real numbers. By an integer relation for a we mean a non-zero integer vector c such that caT = 0. We discuss the algorithms for nding such integer relations f...