Results 31 to 40 of about 53 (48)
Zero Forcing Sets and Bipartite Circulants
, 2010 In this paper we introduce a class of regular bipartite graphs whose biadja-cency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a graph based only
Seth A. Meyer
core
REPRESENTATIONS OF GRAPHS ON A CYLINDER*
, 2008 . A complete characterization ofthe class ofgraphs that admit a cylindric visibility representation is presented, where vertices are representedby intervals parallel to the axis ofthe cylinderand the edgescorrespond to pairs ofvisible intervals. Moreover,
Ioannis
core
Optimizing Bull-Free Perfect Graphs
, 1997 . A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. Here we present polynomial-time combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bull-free perfect graphs. The algorithms are
Celina M. H. De Figueiredo +1 more
core
A [k, k+1]-Factor Containing a Given Hamiltonian Cycle
, 1998 We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k \Gamma 16 for even n and n 6k \Gamma 13 for odd n.
Mikio Kano, Cai Mao-cheng, Yanjun Li
core
A more detailed classification of symmetric cubic graphs
, 2008 A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ.
Marston Conder, Roman Nedela
core
Almost every complement of a tadpole graph is not chromatically unique
, 2013 The study of chromatically unique graphs has been drawing much attention and many results are surveyed in [4, 12, 13]. The notion of adjoint polynomials of graphs was first introduced and applied to the study of the chromaticity of the complements of the
F. Belardo (23465554) +5 more
core
Recognizing Circulant Graphs of Prime Order in Polynomial Time
, 1998 A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a
Mikhail E. Muzychuk, Gottfried Tinhofer
core
On 3-regular and 4-regular Cayley Graphs of Abelian Groups
, 2007 In this paper we find all 3-regular and 4-regular Cayley graphs of abelian groups. Their diameters are almost found. We also give another prove for a well-known theorem that G is 2-DCI if and only if G is 4-CI.
Wai-Chee Shiu
core
Determination Of All Regular Maps Of Small Genus
Complete lists are given of all reflexible orientable regular maps of genus 2 to 15, all non-orientable regular maps of genus 4 to 30, and all (orientable) rotary but chiral (irreflexible) maps of genus 2 to 15 inclusive.
Marston Conder, Peter Dobesányi
core
Some of the next articles are maybe not open access.
A mathematical model for networks with structures in the mesoscale
International Journal of Computer Mathematics, 2012Jesus Gómez-Gardeñes +2 more
exaly