Motivated by the notion of single valued neutrosophic graphs defined by Broumi, Talea, Bakali and Smarandache[2] and notion of intuitionistic fuzzy signed graphs defined by Mishra and Pal[8], we introduce the concept of single valued neutrosophic signed graphs and examine the properties of this new concept and examples.

the edge versions of reverse wiener indices were introduced by mahmiani et al. veryrecently. in this paper, we find their relation with ordinary (vertex) wiener index in somegraphs. also, we compute them for trees and tuc4c8(s) naotubes.

We study the complexity of graph modification problems with respect to homomorphism-based colouring properties edge-coloured graphs. A homomorphism from $G$ $H$ is a vertex-mapping that preserves adjacencies and edge-colours. consider property having fixed $H$. The question we are interested in is: given an $G$, can perform $k$ operations so resulting admits $H$? vertex-deletion, edge-deletion ...

We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. First, we show that the signed join of a negative 2-clique with any positive (n, 3)-regular graph has perfect state transfer even if the unsigned join does not. Curiously, the perfect state transfer time improves as n increases. Next, we prove that a s...

This survey paper provides an introduction to signed graphs, focusing on coloring. We shall introduce the concept of signed graphs, a proper coloring, and basic properties, such as a balanced graph and switchings. We will examine the chromatic number for six special signed graphs, upper bound the chromatic number, and discuss practical applications of signed graphs.

Diagonally equipotent matrices are diagonally dominant matrices for which dominance is never strict in any coordinate. They appear e.g. as Laplacian matrices of signed graphs. We show in this paper that for this class of matrices it is possible to provide a complete characterization of the stability properties based only on the signs of the entries of the matrices.

Recently, Zhang et al. [6] obtained some lower bounds of the signed domination number of a graph. In this paper, we obtain some new lower bounds of the signed domination number of a graph which are sharper than those of them.

We characterize all of the ways to represent the wheel matroids and whirl matroids using frame matroids of signed graphs. The characterization of wheels is in terms of topological duality in the projective plane and the characterization of whirls is in terms of topological duality in the annulus.

We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.

We consider a graph-based model for the study of parallelism in ciliate gene assembly, where a signed graph is associated to each micronuclear gene and the gene assembly is modeled as a graph rewriting process. A natural measure of complexity for gene assembly counts the minimal number of parallel steps needed to reduce the associated signed graph. We investigate the complexity of several class...