Some sufficient conditions for non-Hamiltonicity of graphs are compared.
Block-intersection graphs of Steiner triple systems are considered. We prove that the block-intersection graphs of non-isomorphic Steiner triple systems are themselves non-isomorphic. We also prove that each Steiner triple system of order at most \(15\) has a Hamilton decomposable block-intersection graph.
A directed graph \(G\) is primitive if there exists a positive integer \(k\) such that for every pair \(u, v\) of vertices of \(G\) there is a walk from \(u\) to \(v\) of length \(k\). The least such \(k\) is called the exponent of \(G\). The exponent set \(E_n\) is the set of all integers \(k\) such that there is a primitive graph \(G\) on \(n\) vertices whose exponent is \(k\).
A simple inequality involving the number of components in an arbitrary graph becomes an equality precisely when the graph is chordal. This leads to a mechanism by which any graph parameter, if always at least as large as the number of components, corresponds to a subfamily of chordal graphs. As an example, the domination number corresponds to the well-studied family of \(P_4, C_4\)-free graphs.
In this paper, we will be concerned with graphs \(G\) satisfying: \(G\) is isometrically embeddable in a hypercube; \(|C(a,b)| = |C(b,a)|\) for every edge \([a,b]\) of \(G\). where \(C(a,b)\) is the set of vertices nearer to \(a\) than to \(b\). Some properties of such graphs are shown; in particular, it is shown that all such graphs \(G\) are \(3\)-connected if \(G\) has at least two edges and \(G\) is not a cycle.
We improve upon Caro’s general polynomial characterizations, all in terms of modified line graphs, restricted to decomposing a graph into isomorphic subgraphs \(H\) with two edges. Firstly, we solve the problem for a multigraph; secondly, we decrease the polynomial bound on complexity if \(H = 2K_2\) and provide an original sufficient condition which can be verified in linear time if \(H = P_3\).
It has been shown by Sittampalam and Keedwell that weak critical sets exist for certain latin squares of order six and that previously claimed examples (for certain latin squares of order \(12\)) are incorrect. This led to the question raised in the title of this paper. Our purpose is to show that five is the smallest order for which weakly completable critical sets exist. In the process of proving this result, we show that, for each of the two types of latin square of order four, all minimal critical sets are of the same type.
We show that if \(G\) is a \((2k-1)\)-connected graph \((k \geq 2)\) with radius \(r\), then \(r \leq \left\lfloor \frac{|V(G)|+2k+9}{2k}\right\rfloor\).
A Cayley digraph \({Cay}(G, S)\) of a finite group \(G\) is isomorphic to another Cayley digraph \({Cay}(G, T)\) for each automorphism \(\sigma\) of \(G\). We will call \({Cay}(G, S)\) a CI-graph if, for each Cayley digraph \({Cay}(G,T)\), whenever \({Cay}(G, S) \cong {Cay}(G,T)\) there exists an automorphism \(\sigma\) of \(G\) such that \(S^\sigma = T\). Further, for a positive integer \(m\), if all Cayley digraphs of \(G\) of out-valency \(m\) are CI-graphs, then \(G\) is said to have the \(m\)-DCI property. This paper shows that for any positive integer \(m\), if a finite abelian group \(G\) has the \(m\)-DCI property, then all Sylow subgroups of \(G\) are homocyclic.
A directed graph operation called pushing a vertex is studied. When a vertex is pushed, the orientation of each of its incident edges is reversed. We consider the problems of pushing vertices so as to produce: strongly connected digraphs semi-connected digraphs acyclic digraphs NP-completeness results are shown for each problem. It is shown that it is possible to create a directed path between any two vertices in a digraph; additional positive results and characterizations are shown for: tournaments outerplanar digraphs Hamiltonian cycles.