Related papers: On Weakly Uniform Integer Additive Set-Indexers of…
We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem: an instance is an induced multipartite graph parameter $p$…
Representing patterns as labeled graphs is becoming increasingly common in the broad field of computational intelligence. Accordingly, a wide repertoire of pattern recognition tools, such as classifiers and knowledge discovery procedures,…
Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues.…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by the random coloring. The classification of common graphs is one of the most intriguing problems in…
Deep learning has been shown to be successful in a number of domains, ranging from acoustics, images, to natural language processing. However, applying deep learning to the ubiquitous graph data is non-trivial because of the unique…
A large number of graph invariants of the form $\sum_{uv \in E(G)} F(d_u,d_v)$ are studied in mathematical chemistry, where $uv$ denotes the edge of the graph $G$ connecting the vertices $u$ and $v$, and $d_u$ is the degree of the vertex…
The magnitude of a graph can be thought of as an integer power series associated to a graph; Leinster introduced it using his idea of magnitude of a metric space. Here we introduce a bigraded homology theory for graphs which has the…
We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected…
In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph $G$, called the sub-$k$-domination number and denoted $sub_k(G)$. We show that $sub_k(G)$ is a computationally efficient sharp lower…
In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…
The Bell numbers count the number of different ways to partition a set of $n$ elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex set of a graph into stable sets. This relation between graph…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…
We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are…
This paper consists of a few results, discovered and proved during the 2012-2013 research group at Eastern Oregon University. Inertia tables are a visual representation of the possible inertias of a given graph. The inertia of a graph…