On randomlyn-cyclic digraphs

A digraphD is called randomlyn-cyclic if for each vertexv ofD, every (directed) path with initial vertexv and having length at mostn – 1 can be extended to av – v (directed) cycle of lengthn. This notion was first introduced by Chartrand, Oellermann and Ruiz [3] and they determined all randomly 3, 4 and 5-cyclic diagraphs. In this paper, we will provide the characterization of randomlyn-cyclic digraphs forn 6.     

Connected graphs containing a given connected graph as a unique greatest common subgraph

Those connected graphsG are determined for which there exist nonisomorphic connected graphs of equal size containingG as a unique greatest common subgraph. Analogous results are also obtained for weakly connected and strongly connected digraphs, as well as for induced subgraphs and induced subdigraphs.This research was supported by a Western Michigan University faculty research fellowship.This research was supported in part by a Western Michigan University research assistantship from the Graduate College and the College of Arts and Sciences.     

THE SECOND EXPONENT SET OF PRIMITIVE DIGRAPHS

51.IntroductionandNotationsLetD=(V,E)beadigraphandL(D)denotethesetofcyclelengthsofD.ForuEVandintegeri21,letfo(u):={vEVIthereedestsadirectedwalkoflengthifromutov}.WedelveRo(u):={u}.Letu,vEV.IfN (v)=N (v)andN--(v)=N--(v),thenwecanvacopyofu.LotDbeaprimitivedigraphand7(D)denotetheexponentofD.In1950,H.WielandtI61foundthat7(D)5(n--1)' 1andshowedthatthereisapiquedigraphthatattainsthisbound.In1964,A.L.DulmageandN.S.Mendelsohn[2]ObservedthattherearegapsintheexponentsetEd={ry(D)IDEPD.}…     

On the addressing problem for directed graphs

The “distance” from vertexu to vertexv in a strongly connected digraph is the number of arcs in a shortest directed path fromu tov. The addressing problem, first formulated in the undirected case by Graham and Pollak, entails the assignment of a string of symbols to each vertex in such a way that the distances between vertices are equal to modified Hamming distances between corresponding strings. A scheme for addressing digraphs is proposed, and the minimum address length is studied both in general and in certain special cases. The problem has some interesting reformulations in terms of matrix factorization and extremal set theory. Supported by NSF grant MCS 84-02054.     

Almost Symmetric Cycles in Large Digraphs

We prove that every digraph D with n≥7, n≥+6 vertices and at least (n−k−1)(n−1)+k(k+1) arcs contains all symmetric cycles of length at most n−k−2, an almost symmetric cycle of length n−k−1, and with some exceptions, also an almost symmetric cycle of length n−k. Consequently, D contains all orientations of cycles of length at most n−k, unless D is an exception. The research was partially supported by the AGH University of Science and Technology grant No 11 420 04     

On Hamiltonian Powers of Digraphs

 For a strongly connected digraph D, the k-th power D ^k of D is the digraph with the same set of vertices, a vertex x being joined to a vertex y in D ^k if the directed distance from x to y in D is less than or equal to k. It follows from a result of Ghouila-Houri that for every digraph D on n vertices and for every k≥n/2, D ^k is hamiltonian. In the paper we characterize these digraphs D of odd order whose (⌈n/2 ⌉−1)-th power is hamiltonian. Revised: June 13, 1997     

c-Pancyclic Partial Ordering and （c-1）-Pan-Outpath Partial Ordering in Semicomplete Multipartite Digraphs

An outpath of a vertex v in a digraph is a path starting at v such that v dominates the end vertex of the path only if the end vertex also dominates v.First we show that letting D be a strongly connected semicomplete c-partite digraph (c≥3)1 and one of the partite sets of it consists of a single vertex, say v, then D has a c-pancyclic partial ordering from v, which generalizes a result about pancyclicity of multipartite tournaments obtained by Gutin in 1993.Then we prove that letting D be a strongly connected semicomplete c-partite digraph with c≥3 and letting v be a vertex of D,then Dhas a(c-1)-pan-outpath partly ordering from v.This result improves a theorem about outpaths in semicomplete multipartite digraphs obtained by Guo in 1999.     

The signed <Emphasis Type="Italic">k</Emphasis>-domination number of directed graphs

Let k ≥ 1 be an integer, and let D = (V; A) be a finite simple digraph, for which d _D ⁻ ≥ k − 1 for all v ɛ V. A function f: V → {−1; 1} is called a signed k-dominating function (SkDF) if f(N ⁻[v]) ≥ k for each vertex v ɛ V. The weight w(f) of f is defined by $ \sum\nolimits_{v \in V} {f(v)} $ \sum\nolimits_{v \in V} {f(v)} . The signed k-domination number for a digraph D is γ _kS (D) = min {w(f|f) is an SkDF of D. In this paper, we initiate the study of signed k-domination in digraphs. In particular, we present some sharp lower bounds for γ _kS (D) in terms of the order, the maximum and minimum outdegree and indegree, and the chromatic number. Some of our results are extensions of well-known lower bounds of the classical signed domination numbers of graphs and digraphs.     

Further results on overlarge sets of Kirkman triple systems

In this paper, we introduce a new concept -- overlarge sets of generalized Kirkman systems （OLGKS）, research the relation between it and OLKTS, and obtain some new results for OLKTS. The main conclusion is： If there exist both an OLKF（6^k） and a 3-OLGKS（6^k-1,4） for all k ∈{6,7,...,40}／{8,17,21,22,25,26}, then there exists an OLKTS（v） for any v ≡ 3 （mod 6）, v ≠ 21. As well, we obtain the following result： There exists an OLKTS（6u ＋ 3） for u = 2^2n-1 - 1, 7^n, 31^n, 127^n, 4^r25^s, where n ≥ 1,r＋s≥ 1.     

-Decompositions of and D v ∪P where P is a 2-Regular Subgraph of D v

In this paper, we extend the study of C₄-decompositions of the complete graph with 2-regular leaves and paddings to directed versions. Mainly, we prove that if P is a vertex-disjoint union of directed cycles in a complete digraph D_v, then and D_v∪P can be decomposed into directed 4-cycles, respectively, if and only if v(v−1)−|E(P)|≡0(mod 4) and v(v−1)+|E(P)|≡0(mod 4) where |E(P)| denotes the number of directed edges of P, and v≥8.     

Simple vertices of maximal minor polytopes

Themaximal minor polytope Π _{m, n} is the Newton polytope of the product of all maximal minors of anm×n matrix of indeterminates. The family of polytopes {Π _{m, n} } interpolates between the symmetric transportation polytope (form=n−1) and the permutohedron (form=2). Both transportation polytope and the permutohedron aresimple polytopes but in general Π _{m, n} is not simple. The main result of this paper is an explicit construction of a class of simple vertices of Π _{m, n} for generalm andn. We call themvertices of diagonal type. For every such vertexv we explicitly describe all the edges and facets of Π _{m, n} which containv. Simple vertices of Π _{m, n} have an interesting algebro-geometric application: they correspond tononsingular extreme toric degenerations of the determinantal variety ofm×n matrices not of full rank. Andrei Zelevinsky was partially supported by the NSF under Grant DMS-9104867.     

Colorings and orientations of graphs

Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: IfG is a directed graph with maximum outdegreed, and if the number of Eulerian subgraphs ofG with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a setS(v) ofd+1 colors for each vertexv ofG there is a legal vertex-coloring ofG assigning to each vertexv a color fromS(v).Research supported in part by a United States-Israel BSF Grant and by a Bergmann Memorial Grant.     

On the regulation number of a multigraph

The regulation number of a multigraphG having maximum degreed is the minimum number of additional vertices that are required to construct ad-regular supermultigraph ofG. It is shown that the regulation number of any multigraph is at most 3. The regulation number of a multidigraph is defined analogously and is shown never to exceed 2. A multigraphG has strengthm if every two distinct vertices ofG are joined by at mostm parallel edges. For a multigraphG of strengthm and maximum degreed, them-regulation number ofG is the minimum number of additional vertices that are required to construct ad-regular supermultigraph ofG having strengthm. A sharp upper bound on the 2-regulation number of a multigraph is shown to be (d+5)/2, and a conjecture for generalm is presented. Research supported by a Western Michigan University faculty research fellowship. Research Professor of Electrical Engineering and Computer Science, Stevens Institute, Hoboken, NJ and Visiting Scholar, Courant Institute, New York University, Spring 1984. Research supported in part by a Western Michigan University research assistantship from the Graduate College and the College of Arts and Sciences.     

Limit points of eigenvalues of (di)graphs

The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffman in 1972. Now we extend the study to digraphs. We prove 1. Every real number is a limit point of eigenvalues of graphs. Every complex number is a limit point of eigenvalues of digraphs. 2. For a digraph D, the set of limit points of eigenvalues of iterated subdivision digraphs of D is the unit circle in the complex plane if and only if D has a directed cycle. 3. Every limit point of eigenvalues of a set D of digraphs (graphs) is a limit point of eigenvalues of a set of bipartite digraphs (graphs), where consists of the double covers of the members in D. 4. Every limit point of eigenvalues of a set D of digraphs is a limit point of eigenvalues of line digraphs of the digraphs in D. 5. If M is a limit point of the largest eigenvalues of graphs, then −M is a limit point of the smallest eigenvalues of graphs.     

An approximate Dirac-type theorem for k-uniform hypergraphs

A k-uniform hypergraph is hamiltonian if for some cyclic ordering of its vertex set, every k consecutive vertices form an edge. In 1952 Dirac proved that if the minimum degree in an n-vertex graph is at least n/2 then the graph is hamiltonian. We prove an approximate version of an analogous result for uniform hypergraphs: For every K ≥ 3 and γ > 0, and for all n large enough, a sufficient condition for an n-vertex k-uniform hypergraph to be hamiltonian is that each (k − 1)-element set of vertices is contained in at least (1/2 + γ)n edges. Research supported by NSF grant DMS-0300529. Research supported by KBN grant 2P03A 015 23 and N201036 32/2546. Part of research performed at Emory University, Atlanta. Research supported by NSF grant DMS-0100784.     

The <Emphasis Type="Italic">k</Emphasis>-point exponent set of primitive digraphs with girth 2

Let D = （V, E） be a primitive digraph. The vertex exponent of D at a vertex v∈ V, denoted by expD（v）, is the least integer p such that there is a v →u walk of length p for each u ∈ V. Following Brualdi and Liu, we order the vertices of D so that exPD（V1） ≤ exPD（V2） …≤ exPD（Vn）. Then exPD（Vk） is called the k- point exponent of D and is denoted by exPD （k）, 1≤ k ≤ n. In this paper we define e（n, k） ：= max{expD （k） ｜ D ∈ PD（n, 2）} and E（n, k） ：= {exPD（k）｜ D ∈ PD（n, 2）}, where PD（n, 2） is the set of all primitive digraphs of order n with girth 2. We completely determine e（n, k） and E（n, k） for all n, k with n ≥ 3 and 1 ≤ k ≤ n.     

Applications of matroid partition to tree decomposition

1.IntroductionWeshallassumefamiliaritywithmatroidtheory--foranintroduction,andforthedefinitionoftermsnotdefinedinthispaper,see[31.Edmonds'matroidpartitiontheoremisaveryimportanttheorem,whichhasmanyapplications.Twoclassicresultsof[4,5],whichconcernwithpackingandcoveringoftheedgesetofagraphwithkedge--disjointspanningtrees,canbeeasilydeducedfromit(see[3],PP.125--127).Inthepresentpaperwewillpresentamatroidapproachtotheproblemoftreedecompositionraisedrecently(see[6,7]).Ourmainaimistogivealternati…     

Exponents of two-colored digraphs

We consider the primitive two-colored digraphs whose uncolored digraph has n + s vertices and consists of one n-cycle and one (n − 3)-cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.     

Global Existence and Nonexistence for a Strongly Coupled Parabolic System with Nonlinear Boundary Conditions

This paper deals with the strongly coupled parabolic system ut = v^m△u, vt = u^n△v, （x, t） ∈Ω × （0,T） subject to nonlinear boundary conditions 偏du/偏dη = u^αv^p, 偏du/偏dη= u^qv^β, （x, t） ∈ 偏dΩ × （0, T）, where Ω 包含 RN is a bounded domain, m, n are positive constants and α,β, p, q are nonnegative constants. Global existence and nonexistence of the positive solution of the above problem are studied and a new criterion is established. It is proved that the positive solution of the above problem exists globally if and only if α 〈 1,β 〈 1 and （m ＋p）（n ＋ q） ≤ （1 - α）（1 -β）.     

Highly Arc-Transitive Digraphs With No Homomorphism Onto <Emphasis Type="Bold">Z</Emphasis>

In an infinite digraph D, an edge e' is reachable from an edge e if there exists an alternating walk in D whose initial and terminal edges are e and e'. Reachability is an equivalence relation and if D is 1-arc-transitive, then this relation is either universal or all of its equivalence classes induce isomorphic bipartite digraphs. In Combinatorica, 13 (1993), Cameron, Praeger and Wormald asked if there exist highly arc-transitive digraphs (apart from directed cycles) for which the reachability relation is not universal and which do not have a homomorphism onto the two-way infinite directed path (a Cayley digraph of Z with respect to one generator). In view of an earlier result of Praeger in Australas. J. Combin., 3 (1991), such digraphs are either locally infinite or have equal in- and out-degree. In European J. Combin., 18 (1997), Evans gave an affirmative answer by constructing a locally infinite example. For each odd integer n >= 3, a construction of a highly arc-transitive digraph without property Z satisfying the additional properties that its in- and out-degree are equal to 2 and that the reachability equivalence classes induce alternating cycles of length 2n, is given. Furthermore, using the line digraph operator, digraphs having the above properties but with alternating cycles of length 4 are obtained. Received April 12, 1999 Supported in part by "Ministrstvo za šolstvo, znanost in šport Slovenije", research program PO-0506-0101-99.