منابع مشابه
General Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs
An orthogonal double cover (ODC) of a graph H is a collection ( ) { } v G v V H : = ∈ of ( ) V H subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC of H is cyclic (CODC) if the cyclic group of order ( ) V H is a subgroup of the automorphism group of . In this paper, we introduce a general orthogonal la...
متن کاملPaired Many-to-Many Disjoint Path Covers in Recursive Circulants and Tori
A paired many-to-many -disjoint path cover (paired -DPC) of a graph is a set of disjoint paths joining distinct source-sink pairs in which each vertex of is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants with ≥ and tori, and show that provided the number of faulty elements (vertices and/or edges) is or less, every nonbiparti...
متن کاملDisjoint path covers in recursive circulants G(2m, 4) with faulty elements
A k-disjoint path cover of a graph is defined as a set of k internally vertexdisjoint paths connecting given sources and sinks in such a way that every vertex of the graph is covered by a path in the set. In this paper, we analyze the k-disjoint path cover of recursive circulant G(2m, 4) under the condition that at most f faulty vertices and/or edges are removed. It is shown that whenm ≥ 3, G(2...
متن کاملUnimodular integer circulants
We study families of integer circulant matrices and methods for determining which are unimodular. This problem arises in the study of cyclically presented groups, and leads to the following problem concerning polynomials with integer coefficients: given a polynomial f(x) ∈ Z[x], determine all those n ∈ N such that Res(f(x), xn − 1) = ±1. In this paper we describe methods for resolving this prob...
متن کاملLine Graphs and Circulants
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adjacent in L(G) iff edges x and y share a common vertex in G. In this paper, we determine all graphs G for which L(G) is a circulant graph. We will prove that if L(G) is a circulant, then G must be one of three graphs: the complete graph K4, the cycle Cn, or the complete bipartite graph Ka,b, for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.08.003