Related papers: G-degree for singular manifolds
An edge weighting problem of a graph G is an assignment of an integer weight to each edge e. Based on edge weighting problem, several types of vertex-coloring problems are put forward. A simple observation illuminates that edge weighting…
Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…
The class of special generic maps is a natural class of smooth maps containing Morse functions on spheres with exactly two singular points and canonical projections of unit spheres. We find new restrictions on such maps on $6$-dimensional…
Integrated Gradients (IG) is a common explainability technique to address the black-box problem of neural networks. Integrated gradients assumes continuous data. Graphs are discrete structures making IG ill-suited to graphs. In this work,…
A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs,…
In this short mostly expository note, we sketch a program for gauging fully extended topological field theories in 3 dimensions. One begins with the spherical fusion category with which one wants to do Levin-Wen or Turaev-Viro. One then…
Gems are a particular type of edge-colored graphs, dual to colored triangulations, which represent compact PL-manifolds of arbitrary dimension, both in the closed and boundary case. In the present paper, gem theory is used to approach…
Special generic maps are generalizations of Morse functions with exactly two singular points on spheres and canonical projections of unit spheres. They restrict the manifolds of the domains strongly in considerable cases and are important…
Chemical graphs are simple undirected connected graphs, where vertices represent atoms in a molecule and edges represent chemical bonds. A degree-based topological index is a molecular descriptor used to study specific physicochemical…
For an edge-colored graph $G$, the minimum color degree of $G$ means the minimum number of colors on edges which are adjacent to each vertex of $G$. We prove that if $G$ is an edge-colored graph with minimum color degree at least $5$ then…
We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…
A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum…
Let $G$ be a graph and $R\subseteq V(G)$. A proper edge-coloring of a graph $G$ with colors $1,\ldots,t$ is called an $R$-sequential $t$-coloring if the edges incident to each vertex $v\in R$ are colored by the colors $1,\ldots,d_{G}(v)$,…
We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to…
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…
We study here the graphs with seven vertices in an effort to classify which of them appear as the prime character degree graphs of finite solvable groups. This classification is complete for the disconnected graphs. Of the 853…
An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigraph is a bipartite graph in which each vertex of one part…
The infinite tumbling block graph is a bipartite graph, where each vertex in one partite set is of degree 3 and each vertex in the other partite set is of degree 6. It is a 2-dimensional array of blocks of seven vertices and nine edges, a…
Let $G$ be an edge-colored graph. The color degree of a vertex $v$ of $G$, is defined as the number of colors of the edges incident to $v$. The color number of $G$ is defined as the number of colors of the edges in $G$. A rainbow triangle…
In this paper we determined all of the possible self mapping degrees of the manifolds with $S^3$-geometry, which are supposed to be all 3-manifolds with finite fundamental groups. This is a part of a project to determine all possible self…