Sciweavers

Share
GC
2008
Springer
8 years 11 months ago
On 2-Detour Subgraphs of the Hypercube
A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by ...
József Balogh, Alexandr V. Kostochka
GC
2008
Springer
8 years 11 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
GC
2008
Springer
8 years 11 months ago
Error Correcting Sequence and Projective De Bruijn Graph
Mariko Hagita, Makoto Matsumoto, Fumio Natsu, Yuki...
GC
2008
Springer
8 years 11 months ago
The Unbalance of Set Systems
Nathan Lemons, Cory Palmer
GC
2008
Springer
8 years 11 months ago
The Fine Intersection Problem for Steiner Triple Systems
Yeow Meng Chee, Alan C. H. Ling, Hao Shen
GC
2008
Springer
8 years 11 months ago
On the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
Robert E. Jamison, Gretchen L. Matthews
GC
2008
Springer
8 years 11 months ago
Domination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
Christian Löwenstein, Dieter Rautenbach
GC
2008
Springer
8 years 11 months ago
Silver Cubes
An n
Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mah...
GC
2008
Springer
8 years 11 months ago
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...
GC
2008
Springer
8 years 11 months ago
Almost Given Length Cycles in Digraphs
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Raphael Yuster
books