Related papers: On the graph condition regarding the $F$-inverse c…
In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…
All graphs considered are simple and undirected. The Inverse Eigenvalue Problem of a Graph $G$ (IEP-G) aims to find all possible spectra for matrices whose $(i,j)-$entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. A…
An abelian cover is a finite morphism $X\to Y$ of varieties which is the quotient map for a generically faithful action of a finite abelian group $G$. Abelian covers with $Y$ smooth and $X$ normal were studied in…
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…
Minimal separators in graphs are an important concept in algorithmic graph theory. In particular, many problems that are NP-hard for general graphs are known to become polynomial-time solvable for classes of graphs with a polynomially…
Let $X$ be an irreducible algebraic variety over $\mathbb{C}$, endowed with an algebraic foliation ${\cal{F}}$. In this paper, we introduce the notion of minimal invariant variety $V({\cal{F}},Y)$ with respect to $({\cal{F}},Y)$, where $Y$…
A class of graphs is $\chi$-bounded if there is a function $f$ such that $\chi(G)\le f(\omega(G))$ for every induced subgraph $G$ of every graph in the class, where $\chi,\omega$ denote the chromatic number and clique number of $G$…
Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering,…
The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate some convex combination of proper cuts. Minimizing a nonnegative linear function over the cut dominant is equivalent to finding a minimum…
We obtain a characterisation of confined subgroups of Thompson's group $F$. As a result, we deduce that orbital graph of a point under action of $F$ has uniformly subexponential growth if and only if this point is fixed by the commutator…
Each hereditary property can be characterized by its set of minimal obstructions; these sets are often unknown, or known but infinite. By allowing extra structure it is sometimes possible to describe such properties by a finite set of…
We start by building up some theory to state Wagner's Theorem, and then prove it using Kuratowski's Theorem, a proof of which is found in Diester (2000). Following this, we establish some connections between the chromatic number of a graph…
The genus graphs have been studied by many authors, but just a few results concerning in special cases: Planar, Toroidal, Complete, Bipartite and Cartesian Product of Bipartite. We present here a derive general lower bound for the genus of…
Word maps in a group, an analogue of polynomials in groups, are defined by substitution of formal words. Lubotzky gave a characterization of the images of word maps in finite simple groups, and a consequence of his characterization is the…
We study the convergence of graphs consisting of finitely many internal rays for degenerating Newton maps. We state a sufficient condition to guarantee the convergence. As an application, we investigate the boundedness of hyperbolic…
In this paper we study Sigma invariants of even Artin groups of FC-type, extending some known results for right-angled Artin groups. In particular, we define a condition that we call the strong homological $n$-link condition for a graph…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…
Motivated by the recent work of Xiao and Zhong [AIMS Math. 9 (2024), 35125--35150: MR4840882], we propose a generalized inverse for a hyper-dual matrix called hyper-dual group generalized inverse (HDGGI). Under certain necessary and…