Vertex-Generator Subgraphs of Complete Bipartite and Tadpole Graphs

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such that ${\rm Aut}(\Sigma)$ contains a subgroup isomorphic to $H$ acting semiregularly on $V(\Sigma)$ and the $H$-orbits are equal to the bipartite sets of $\Sigma$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that the groups $D_6, \, D_8, \, D_{10}$ and $Q_8$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs (a group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian). As an application, it is also shown that every non-solvable group has a Haar graph which is not a Cayley graph.

Chapter 5 - Vector Spaces, Hilbert Spaces, and the L2 Space

The area of interest of this paper is recursively enumerable vector spaces; its origins lie in the works of Rabin [16], Dekker [4], [5], Crossley and Nerode [3], and Metakides and Nerode [14]. We concern ourselves here with questions about maximal vector spaces, a notion introduced by Metakides and Nerode in [14]. The domain of discourse is V∞ a fully effective, countably infinite dimensional vector space over a recursive infinite field F.By fully effective we mean that V∞, under a fixed Gödel numbering, has the following properties:(i) The operations of vector addition and scalar multiplication on V∞ are represented by recursive functions.(ii) There is a uniform effective procedure which, given n vectors, determines whether or not they are linearly dependent (the procedure is called a dependence algorithm).We denote the Gödel number of x by ⌈x⌉ By taking {εn ∣ n > 0} to be a fixed recursive basis for V∞, we may effectively represent elements of V∞ in terms of this basis. Each element of V∞ may be identified uniquely by a finitely-nonzero sequence from F Under this identification, εn corresponds to the sequence whose n th entry is 1 and all other entries are 0. A recursively enumerable (r.e.) space is a subspace of V∞ which is an r.e. set of integers, ℒ(V∞) denotes the lattice of all r.e. spaces under the operations of intersection and weak sum. For V, W ∈ ℒ(V∞), let V mod W denote the quotient space. Metakides and Nerode define an r.e. space M to be maximal if V∞ mod M is infinite dimensional and for all V ∈ ℒ(V∞), if V ⊇ M then either V mod M or V∞ mod V is finite dimensional. That is, M has a very simple lattice of r.e. superspaces.

We construct and analyze an explicit basis for the homology of the boolean complex of a finite simple graph. This provides a combinatorial description of the spheres in the wedge sum representing the homotopy type of the complex. We assign a set of derangements to any finite simple graph. For each derangement, we construct a corresponding element in the homology of the complex, and the collection of these elements forms a basis for the homology of the boolean complex. In this manner, the spheres in the wedge sum describing the homotopy type of the complex can be represented by a set of derangements. We give an explicit, closed-form description of the derangements that can be obtained from any finite simple graph, and compute this set for several families of graphs. In the cases of complete graphs and Ferrers graphs, these calculations give bijective proofs of previously obtained enumerative results.

In this dissertation, we prove that if the flag complex on a finite simplicial graph is a 2-dimensional triangulated disk, then the Dehn function of the associated Bestvina--Brady group depends on the maximal dimension of the simplices in the interior of the flag complex. We also give some examples where the flag complex on a finite simplicial graph is not 2-dimensional, and we establish a lower bound for the Dehn function of the associated Bestvina--Brady group.

The main point of this paper is a further development of some aspects of the recent theory of recursively enumerable (r.e.) algebraic structures. Initial work in this area is due to Frölich and Shepherdson [4] and Rabin [10]. Here we are only concerned with vector space structure. The previous work on r.e. vector spaces is due to Dekker [2], [3], Metakides and Nerode [8], Remmel [11], Retzlaff [13], and the author [5].Our object of study is V∞ a countably infinite dimensional fully effective vector space over a countable recursive field . By fully effective we mean that V∞. under a fixed Godel numbering has the following properties:(i) Operations of vector addition and scalar multiplication on V∞ are presented by partial recursive functions on the Gödel numbers of elements of V∞.(ii) V∞ has a dependence algorithm, i.e., there is a uniform effective procedure which applied to any n vectors of V∞ determines whether or not they are linearly independent.We also study , the lattice of r.e. subspaces of V∞ (under the operations of intersection, ⋂ and (weak) sum, +). We note that if is not distributive and is merely modular (see [1]). This fact indicates the essential difference between the lattice of r.e. sets and .

Symmetric edge polytopes $\mathcal{A}_G$ of type A are lattice polytopes arising from the root system $A_n$ and finite simple graphs $G$. There is a connection between $\mathcal{A}_G$ and the Kuramoto synchronization model in physics. In particular, the normalized volume of $\mathcal {A}_G$ plays a central role. In the present paper, we focus on a particular class of graphs. In fact, for any cactus graph $G$, we give a formula for the $h^*$-polynomial of $\mathcal{A}_{\widehat{G}}$ by using matching generating polynomials, where $\widehat{G}$ is the suspension of $G$. This gives also a formula for the normalized volume of $\mathcal{A}_{\widehat{G}}$. Moreover, via the chemical graph theory, we show that for any cactus graph $G$, the $h^*$-polynomial of $\mathcal{A}_{\widehat{G}}$ is real-rooted. Finally, we extend the discussion to symmetric edge polytopes of type $B$, which are lattice polytopes arising from the root system $B_n$ and finite simple graphs.

The aim of the paper is to study and to solve finite systems of equations over finite undirected graphs. Equations over graphs are atomic formulas of the language L consisting of the set of constants (graph vertices), the binary vertex adjacency predicate and the equality predicate. It is proved that the problem of checking compatibility of a system of equations S with k variables over an arbitrary simple n-vertex graph Γ is N P-complete. The computational complexity of the procedure for checking compatibility of a system of equations S over a simple graph Γ and the procedure for finding a general solution of this system is calculated. The computational complexity of the algorithm for solving a system of equations S with k variables over an arbitrary simple n-vertex graph Γ involving these procedures is O(k 2n k/2+1(k + n) 2 ) for n > 3. Polynomially solvable cases are distinguished: systems of equations over trees, forests, bipartite and complete bipartite graphs. Polynomial time algorithms for solving these systems with running time O(k 2n(k + n) 2 ) are proposed.

An n-crown on 2n vertices is a graph obtained from complete bipartite graph by removing edges of a perfect matching. Given a finite simple graph G, one can associate a simplicial complex . In this article, we use combinatorial data from the associated simplicial complex of the crown graph and give formulas to find all Betti numbers of edge ideals of .

In his pioneering paper on matroids in 1935, Whitney obtained a characterization for binary matroids and left a comment at end of the paper that the problem of characterizing graphic matroids is the same as that of characterizing matroids which correspond to matrices (mod 2) with exactly two ones in each column. Later on Tutte obtained a characterization of graphic matroids in terms of forbidden minors in 1959. It is clear that Whitney indicated about incidence matrices of simple undirected graphs. Here we introduce the concept of a segment binary matroid which corresponds to matrices over $\mathbb{Z}_2$ which has the consecutive $1$'s property (i.e., $1$'s are consecutive) for columns and obtained a characterization of graphic matroids in terms of this. In fact, we introduce a new representation of simple undirected graphs in terms of some vectors of finite dimensional vector spaces over $\mathbb{Z}_2$ which satisfy consecutive $1$'s property. The set of such vectors is called a coding sequence of a graph $G$. Among all such coding sequences we identify the one which is unique for a class of isomorphic graphs. We call it the code of the graph. We characterize several classes of graphs in terms of coding sequences. It is shown that a graph $G$ with $n$ vertices is a tree if and only if any coding sequence of $G$ is a basis of the vector space $\mathbb{Z}_2^{n-1}$ over $\mathbb{Z}_2$. Moreover considering coding sequences as binary matroids, we obtain a characterization for simple graphic matroids and found a necessary and sufficient condition for graph isomorphism in terms of a special matroid isomorphism between their corresponding coding sequences. For this, we introduce the concept of strong isomorphisms of segment binary matroids and show that two simple (undirected) graphs are isomorphic if and only if their canonical sequences are strongly isomorphic segment binary matroids.

Frugal resolvent splittings are a class of fixed point algorithms for finding a zero in the sum of the sum of finitely many set-valued monotone operators, where the fixed point operator uses only vector addition, scalar multiplication and the resolvent of each monotone operator once per iteration. In the literature, the convergence analyses of these schemes are performed in an inefficient, algorithm-by-algorithm basis. In this work, we address this by developing a general framework for frugal resolvent splitting which simultaneously covers and extends several important schemes in the literature. The framework also yields a new resolvent splitting algorithm which is suitable for decentralised implementation on regular networks.

It is known that the polyomino ideal arising from a simple polyomino comes from a finite bipartite graph and, in particular, it is a prime ideal. A class of nonsimple polyominoes $\mathcal{P}$ for which the polyomino ideal $I_{\mathcal{P}}$ is a prime ideal and for which $I_{\mathcal{P}}$ cannot come from a finite simple graph will be presented.

Extract Although examples drive this book, we first provide a whirlwind survey of the general concepts of operator theory. We do not expect the student to master these topics now since they are covered in future chapters. A Hilbert space H is a complex vector space endowed with an inner product ⟨x,y⟩ that defines a norm ‖x‖=⟨x,x⟩ with respect to which H is (Cauchy) complete. The inner product on a Hilbert space satisfies the Cauchy–Schwarz inequality |⟨x,y⟩|⩽‖x‖‖y‖ for all x,y∈H⁠. Examples of Hilbert spaces include Cn (complex Euclidean space), ℓ2 (the space of square-summable complex sequences), and L2[0,1] (the Lebesgue space of square-integrable, complex-valued functions on [0,1]⁠). Vectors x,y in a Hilbert space H are orthogonal if ⟨x,y⟩=0⁠. The dimension of a Hilbert space H is the cardinality of a maximal set of nonzero orthogonal vectors. This book is almost exclusively concerned with Hilbert spaces of countable dimension. Every such Hilbert space has an orthonormal basis (un)n=1∞⁠, a (possibly finite) maximal orthogonal set such that ⟨um,un⟩=δmn for all m,n⩾1⁠. With respect to an orthonormal basis (un)n=1∞⁠, each x∈H enjoys a generalized Fourier expansion x=∑n=1∞⟨x,un⟩un that satisfies Parseval’s identity ‖x‖2=∑n=1∞|⟨x,un⟩|2. A subspace (a norm-closed linear submanifold) of H is itself a Hilbert space with the operations inherited from H⁠. If (wn)n=1∞ is a (possibly finite) orthonormal basis for a subspace M of H and x∈H⁠, then PMx=∑n=1∞⟨x,wn⟩wn belongs to M and satisfies ‖x−PMx‖⩽‖x−y‖ for every y∈M⁠. In short, PMx is the unique closest vector to x in M⁠. Furthermore, PM defines a linear transformation on H whose range is M⁠. It is called the orthogonal projection of H onto M and it satisfies PM2=PM and ⟨PMx,y⟩=⟨x,PMy⟩ for all x,y∈H⁠. Let H and K be Hilbert spaces. A linear transformation A:H→K is bounded if ‖A‖=sup{‖Ax‖K:‖x‖H=1} is finite. Let B(H,K) denote the set of bounded linear operators from H to K⁠. We write B(H) for B(H,H)⁠. The quantity ‖A‖ is the norm of A. Since B(H) is closed under addition and scalar multiplication, it is a vector space. Furthermore, since ‖A+B‖⩽‖A‖+‖B‖ and ‖cA‖=|c|‖A‖ for all A,B∈B(H) and c∈C⁠, it follows that B(H) is a normed vector space. Endowed with this norm, B(H) is complete and thus forms a Banach space. Moreover, the composition AB belongs to B(H) and ‖AB‖⩽‖A‖‖B‖ for all A,B∈B(H)⁠. Therefore, B(H) is a Banach algebra. For each A∈B(H,K)⁠, there is a unique A*∈B(K,H) such that ⟨Ax,y⟩K=⟨x,A*y⟩H for all x∈H and y∈K⁠. The operator A* is the adjoint of A; it is the analogue of the conjugate transpose of a matrix. One can show that A↦A* is conjugate linear, that A**=A⁠, ‖A‖=‖A*‖⁠, and ‖A*A‖=‖A‖2⁠. This additional structure upgrades B(H) from a Banach algebra to a C*-algebra. One can exploit adjoints to obtain information about the kernel and range of an operator. For most of the operators A∈B(H) covered in this book, we give the matrix representation [A]=[⟨Auj,ui⟩]i,j=1∞ with respect to an orthonormal basis (un)n=1∞ for H⁠. This matrix representation [A] defines a bounded operator x↦[A]x on the Hilbert space ℓ2 of square summable sequences that is structurally identical to A. Schur’s theorem helps us determine which infinite matrices define bounded operators on ℓ2⁠. Many of the operators covered in this book, such as the Cesàro operator, the Volterra operator, weighted shifts, Toeplitz operators, and Hankel operators, have fascinating structured-matrix representations. An important class of operators is the compact operators. These are the A∈B(H) such that (Axn)n=1∞ has a convergent subsequence whenever (xn)n=1∞ is a bounded sequence in H⁠. Equivalently, an operator is compact if it takes each bounded set to one whose closure is compact. Each finite-rank operator is compact and every compact operator is the norm limit of finite-rank operators. The compact operators form a norm-closed, *-closed ideal within B(H)⁠. Some operators have a particularly close relationship with their adjoint. For example, the operator M on L2[0,1] defined by (Mf)(x)=xf(x) satisfies M*=M⁠. Such operators are selfadjoint. If µ is a positive finite compactly supported Borel measure on C⁠, then the operator N on L2(μ) defined by (Nf)(z)=zf(z) satisfies (N*f)(z)=z―f(z)⁠, and thus N*N=NN*⁠. Such operators are normal. The operator (Uf)(eiθ)=eiθf(eiθ) on L2(T) satisfies U*U=UU*=I⁠. Such operators are unitary. Unitary operators preserve the ambient structure of Hilbert spaces and can serve as a vehicle to relate A∈B(H) with B∈B(K)⁠. We say that A is unitarily equivalent to B if there is a unitary U∈B(H,K) such that UAU*=B⁠. Unitary equivalence is often used to identify seemingly complicated operators with relatively simple ones.

(a, b, k)-critical graphs

Let $G=(V(G),E(G))$ be a finite simple undirected graph with vertex set $V(G)$, edge set $E(G)$ and vertex subset $S\subseteq V(G)$. $S$ is termed \emph{open-dominating} if every vertex of $G$ has at least one neighbor in $S$, and \emph{open-independent, open-locating-dominating} (an $OLD_{oind}$-set for short) if no two vertices in $G$ have the same set of neighbors in $S$, and each vertex in $S$ is open-dominated exactly once by $S$. The problem of deciding whether or not $G$ has an $OLD_{oind}$-set has important applications that have been reported elsewhere. As the problem is known to be $\mathcal{NP}$-complete, it appears to be notoriously difficult as we show that its complexity remains the same even for just planar bipartite graphs of maximum degree five and girth six, and also for planar subcubic graphs of girth nine. Also, we present characterizations of both $P_4$-tidy graphs and the complementary prisms of cographs that have an $OLD_{oind}$-set.