相关论文: Row graphs of Toeplitz matrices

A Toeplitz graph $T_n \langle t_1,t_2,\ldots,t_k\rangle$ is a simple graph with the vertex set $[n]$ such that two vertices $v$ and $w$ are adjacent if and only if $|v-w| = t_i$ for some $i \in [k]$. In this paper, we investigate line…

In this paper, we study structural properties of Toeplitz graphs. We characterize $K_q$-free Toeplitz graphs for an integer $q \ge 3$ and give equivalent conditions for a Toeplitz graph $G_n\langle t_1, t_2,\ldots, t_k\rangle$ with…

In this paper, we study the matrix period and the competition period of Toeplitz matrices over a binary Boolean ring $\mathbb{B} = \{0,1\}$. Given subsets $S$ and $T$ of $\{1,\ldots,n-1\}$, an $n\times n$ Toeplitz matrix $A=T_n\langle S ; T…

For a row-finite higher-rank graph {\Lambda}, we construct a higher-rank graph T{\Lambda} such that the Toeplitz algebra of {\Lambda} is isomorphic to the Cuntz-Krieger algebra of T{\Lambda}. We then prove that the higher-rank graph…

We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…

Reeb graphs are simple topological descriptors with applications in many areas like topological data analysis and computational geometry. Despite their prevalence, visualization of Reeb graphs has received less attention. In this paper, we…

We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs…

Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a class of Toeplitz graphs, and will be denoted by…

The maximal algebras of scalar Toeplitz matrices are known to be formed by generalized circulants. The identification of algebras consisting of block Toeplitz matrices is a harder problem, that has received little attention up to now. We…

For each non-negative integer $n$ let $\mathcal{A}_n$ be an $n+1$ by $n+1$ Toeplitz matrix over a finite field, $F$, and suppose for each $n$ that $\mathcal{A}_n$ is embedded in the upper left corner of $\mathcal{A}_{n+1}$. We study the…

Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $xyxy\cdots$ (of even or odd length) or a word of the form $yxyx\cdots$ (of even or…

The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to…

In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…

In this paper, we investigate properties of a symmetric Toeplitz matrix and a Hankel matrix by studying the components of its graph. To this end, we introduce the notion of ``weighted Toeplitz graph" and ``weighted Hankel graph", which are…

The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for generating a topological drawing of a flat part of a graph…

Let d=(d_1,d_2,..., d_n) be a vector of non-negative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1.…

The classification of maximal algebras of square block Toeplitz matrices is a considerably more difficult problem and has received relatively little attention in the existing literature. In this work, we approach the problem under the…

The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path…

The eccentricity matrix $\epsilon(G)$, of a connected graph $G$ is obtained by retaining the maximum distance from each row and column of the distance matrix of $G$ and the other entries are assigned with 0. In this paper, we discuss the…

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…