Related papers: A Study on Integer Additive Set-Valuations of Sign…

A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\{1,2, \ldots, n \}$ to the vertices of $G$. The strength $\mathrm{str}\left(G\right) $ of $G$ is defined by $\mathrm{str}\left( G\right)…

A Cameron-Walker graph is a graph for which the matching number and the induced matching number are the same. Assume that $G$ is a Cameron-Walker graph with edge ideal $I(G)$, and let $\ind-match(G)$ be the induced matching number of $G$.…

Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…

A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…

A simple $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,\ldots, n$ such that adjacent vertices have relatively prime labels. We will present previously unknown prime vertex…

We introduce the \emph{ID-index} of a finite simple connected graph. For a graph $G=(V,\ E)$ with diameter $d$, we let $f:V\longrightarrow \mathbb{R}$ assign \emph{ranks} to the vertices, then under $f$, each vertex $v$ gets a…

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…

Let $\overrightarrow{G}$ be a directed graph of order $n$ with no component of order less than $4$, and let $\Gamma$ be a finite Abelian group such that $|\Gamma|\geq n+6$. We show that there exists a mapping $\psi$ from the arc set…

The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $\Gamma$ is the set of all fixing numbers of finite…

Our approach to structural matrix rings defines them over preordered directed graphs. A grading of a structural matrix ring is called a good grading if its standard unit matrices are homogeneous. For a group $G$, a $G$ -grading set is a set…

We consider realizations of a graph in the plane such that the distances between adjacent vertices satisfy the constraints given by an edge labeling. If there are infinitely many such realizations, counted modulo rigid motions, the labeling…

In this paper, we introduce the concept of \emph{Perrin cordial labeling}, a novel vertex labeling scheme inspired by the Perrin number sequence and situated within the broader framework of graph labeling theory. The Perrin numbers are…

Many mathematical objects can be represented as functors from finitely-presented categories $\mathsf{C}$ to $\mathsf{Set}$. For instance, graphs are functors to $\mathsf{Set}$ from the category with two parallel arrows. Such functors are…

The quality of graph-structured data is fundamental to the success of modern graph analysis techniques such as Graph Neural Networks (GNNs). However, real-world graph data is often suboptimal, suffering from issues such as noise and…

The fixing number of a graph $G$ is the order of the smallest subset $S$ of its vertex set $V(G)$ such that stabilizer of $S$ in $G$, $\Gamma_{S}(G)$ is trivial. Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$, and let…

Given a graph $G = (V,E)$, a subgraph $H$ is an \emph{additive $+\beta$ spanner} if $\dist_H(u,v) \le \dist_G(u,v) + \beta$ for all $u, v \in V$. A \emph{pairwise spanner} is a spanner for which the above inequality only must hold for…

We study \emph{edge-sum distinguishing labeling}, a type of labeling recently introduced by Tuza in [Zs. Tuza, \textit{Electronic Notes in Discrete Mathematics} 60, (2017), 61-68] in context of labeling games. An \emph{ESD labeling} of an…

A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…

A graph $F$ is called a fractalizer if for all $n$ the only graphs which maximize the number of induced copies of $F$ on $n$ vertices are the balanced iterated blow ups of $F$. While the net graph is not a fractalizer, we show that the net…

Zero forcing in graphs is a coloring process where a colored vertex can force its unique uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices capable of eventually coloring all vertices of the graph.…