Related papers: Chromatic Topological Indices of Certain Cycle Rel…
Roughly speaking, lamplighter graphs encode the possible configurations of a lamplighter that moves along a given graph and that modifies the colours of lamps at vertices. This article is dedicated to the following delicate question: when…
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…
Local markers provide an efficient and powerful characterization of topological features of many systems, especially when the translation symmetry is broken. Recently, a universal topological local marker applicable in different symmetry…
The anagram-free chromatic number is a new graph parameter introduced independently Kam\v{c}ev, {\L}uczak, and Sudakov (2017) and Wilson and Wood (2017). In this note, we show that there are planar graphs of pathwidth 3 with arbitrarily…
We develop further the new versions of quantum chromatic numbers of graphs introduced by the first and fourth authors. We prove that the problem of computation of the commuting quantum chromatic number of a graph is solvable by an SDP…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…
We examine the chromatic index of generalized truncations of graphs and multigraphs.
A topological index reflects the physical, chemical and structural properties of a molecule, and its study has an important role in molecular topology, chemical graph theory and mathematical chemistry. It is a natural problem to…
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of…
The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give…
We discuss some bulk-surfaces gapped Hamiltonians on a lattice with corners and propose a periodic table for topological invariants related to corner states aimed at studies of higher-order topological insulators. Our table is based on four…
Concerning the recent notion of circular chromatic number of signed graphs, for each given integer $k$ we introduce two signed bipartite graphs, each on $2k^2-k+1$ vertices, having shortest negative cycle of length $2k$, and the circular…
In this paper, we present the lower bounds for the number of vertices in a graph with a large chromatic number containing no small odd cycles.
In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…
A proper edge-coloring of a graph $G$ with colors $1,\ldots,t$ is called an \emph{interval cyclic $t$-coloring} if all colors are used, and the edges incident to each vertex $v\in V(G)$ are colored by $d_{G}(v)$ consecutive colors modulo…
The acyclic chromatic index of a graph $G$ is the least number of colors needed to properly color its edges so that none of its cycles is bichromatic. In this work, we show that $2\Delta-1$ colors are sufficient to produce such a coloring,…
The first Zagreb index $M_{1}(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_{2}(G)$ is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying…