Related papers: Non-unique factorizations, land surveying and elec…

We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…

The present paper considers multipartite graphs from the perspective of design theory and coding theory. A one-factor $F$ of the complete multipartite graph $K_{n\times g}$ (with $n$ parts of size $g$) gives rise to a $(g+1)$-ary code…

We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic…

We define the induced arboricity of a graph $G$, denoted by ${\rm ia}(G)$, as the smallest $k$ such that the edges of $G$ can be covered with $k$ induced forests in $G$. This notion generalizes the classical notions of the arboricity and…

For a given graph G and an associated class of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in G, the collection of all possible spectra for such matrices is considered. Building on the pioneering work…

A Nikishin-Maurey characterization is given for bounded subsets of weak-type Lebesgue spaces. New factorizations for linear and multilinear operators are shown to follow.

In order to use the Gaussian representation for propagators in Feynman amplitudes, a representation which is useful to relate string theory and field theory, one has to prove first that each $\alpha$- parameter (where $\alpha$ is the…

We prove a neat factorization property of Feynman graphs in covariant perturbation theory. The contribution of the graph to the effective action is written as a product of a massless scalar momentum integral that only depends on the basic…

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As…

Let $\Fth$ be a single vertex \textsf{k}-graph, and $\pi_\omega(\O_\theta)"$ be the von Neumann algebra induced from the GNS representation of a distinguished state $\omega$ of its $\textsf{k}$-graph C*-algebra $\O_\theta$. In this paper,…

We develop a perturbative QCD factorization theorem which is compatible with effective field theory. The factorization involves three scales: an infrared cutoff of order $\Lambda_{\rm QCD}$, a hard scale of order the $B$ meson mass, and an…

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…

In this article, we give characterization for existence of quantum fractional revival in unitary Cayley graph utilizing adjacency matrix Hamiltonian. Unitary Cayley graph $X=( Z_n, S)$ is a special graph as connection set $S \subseteq Z_n$…

We call a set $\mathcal S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\mathcal…

A Cayley graph over a group $G$ is said to be central if its connection set is a normal subset of $G$. We prove that every central Cayley graph over a simple group $G$ has at most two pairwise nonequivalent Cayley representations over $G$…

Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…

We investigate Birkhoff (or triangular) factorization and (what we propose to call) root subgroup factorization for elements of a noncompact simple Lie group $G_0$ of inner type. For compact groups root subgroup factorization is related to…

The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where N is the semiring of finite simple graphs and where Z and Q are integral domains, culminating in a Banach algebra R. A single network completes to the Wiener algebra.…

This paper is the first from a series of papers that establish a common analogue of the strong component and basilica decompositions for bidirected graphs. A bidirected graph is a graph in which a sign $+$ or $-$ is assigned to each end of…

We extend Pisier's abstract version of Grothendieck's theorem to general non-locally convex quasi-Banach spaces. We also prove a related result on factoring operators through a Banach space and apply our results to the study of…