Related papers: Polynomial graph invariants induced from the ${\ma…
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
A communication network can be modeled as a directed connected graph with edge weights that characterize performance metrics such as loss and delay. Network tomography aims to infer these edge weights from their pathwise versions measured…
The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It…
This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights $1,...,|E(G)|$ to the edges of any given graph $G$ (with no component isomorphic to $K_2$) so that every two adjacent…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
This paper treats some basic points in general relativity and in its perturbative analysis. Firstly a systematic classification of global SO(n) invariants, which appear in the weak-field expansion of n-dimensional gravitational theories, is…
The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
We give an expression of the $q$-analogues of the multiplicities of weights in irreducible $\sl_{n+1}$-modules in terms of the geometry of the crystal graph attached to the corresponding $U_q(\sl_{n+1})$-modules. As an application, we…
Let $K$ be a field, $\Gamma $ a finite group of field automorphisms of $K$, $F$ the $\Gamma $-fixed field in $K$ and $G\leq $GL$_v(K)$ a finite matrix group. Then the action of $\Gamma $ defines a grading on the symmetric algebra of the…
Paths $P_1,\ldots,P_k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P_i$ and $P_j$ have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to decide if…
Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…
Stanley's symmetrized chromatic polynomial is a generalization of the ordinary chromatic polynomial to a graph invariant with values in a ring of polynomials in infnitely many variables. The ordinary chromatic polynomial is a specialization…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general…
We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…
The zero forcing number of a simple graph, written $Z(G)$, is a NP-hard graph invariant which is the result of the zero forcing color change rule. This graph invariant has been heavily studied by linear algebraists, physicists, and graph…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent…