Related papers: Further Results on Signed Product Cordial Labeling
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. Irreflexive signed graphs are in a…
A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices.
The distinguishing index of a graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of $G$ not preserved by any non-trivial automorphism. The distinguishing chromatic index $\chi'_D (G)$ of a graph $G$ is the…
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A connected graph $G$ is said to be $t$-admissible if admits a special spanning tree in which the distance between any two adjacent vertices…
Chordal graphs are important in algorithmic graph theory. Chordal digraphs are a digraph analogue of chordal graphs and have been a subject of active studies recently. Unlike chordal graphs, chordal digraphs lack many structural properties…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
A surprising diversity of different products of hypergraphs have been discussed in the literature. Most of the hypergraph products can be viewed as generalizations of one of the four standard graph products. The most widely studied variant,…
A weighted coloured-edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such…
This paper continues description of applications of signed chord length distribution started in part I (arXiv:0711.4734). It is shown simple relation between equation for some transfer integrals with source and target bodies and different…
A graph $G$ is a {\em chordal-$k$-generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G[V \setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split graphs are…
Khovanov introduced a bigraded cohomology theory of links whose graded Euler characteristic is the Jones polynomial. The theory was subsequently applied to the chromatic polynomial of graph, resulting in a categorification known as the…
A "signed graph" is a graph $\Gamma$ where the edges are assigned sign labels, either "$+$" or "$-$". The sign of a cycle is the product of the signs of its edges. Let $\mathrm{SpecC}(\Gamma)$ denote the list of lengths of cycles in…
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions.…
Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index of the main products of graphs. Here, we obtain several…
We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it…
In graph property testing the task is to distinguish whether a graph satisfies a given property or is "far" from having that property, preferably with a sublinear query and time complexity. In this work we initiate the study of property…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
In this research, the exact results on $r$-dynamic coloring of lexicographic product of path with star graph, path with double star graph, path with triple star graph and finally complete graph with path are obtained.
Grid intersection graphs are the intersection graphs of vertical and horizontal segments in the plane. When the bottom and respectively left endpoints of the vertical and horizontals segments belong to a line with negative slope, the graph…
This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local…