Abstract Recently, Gross, Mansour and Tucker introduced the partial-dual polynomial of a ribbon graph as generating function that enumerates all partial duals by Euler genus. It is analogous to extensively studied in topological theory genus embeddings given graph. To investigate polynomial, one only needs focus on bouquets: is, graphs with exactly vertex. In this paper, we shall further show b...

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.

A signed graph is a simple graph where each edge receives a sign positive or negative. Such graphs are mainly used in social sciences where individuals represent vertices friendly relation between them as a positive edge and enmity as a negative edge. In signed graphs, we define these relationships (edges) as of friendship ("+" edge) or hostility ("-" edge). A 2-path product signed graph [Formu...

• Let G be a graph. For subset X of V ( ), the switching σ is signed graph obtained from by reversing signs all edges between and ) ∖ . A( adjacency matrix An eigenvalue called main if it has an eigenvector sum whose entries not equal to zero. Two equivalent graphs share same spectrum, while they may have different eigenvalues. Akbari et al. (2021) conjectured that let ≠ K 2 , 4 { e } Then ther...

We construct a quantum searching model of signed edge driven by walk. The time evolution operator this walk provides weighted adjacency matrix induced the assignment sign to each edge. This can be regarded as so-called coloring. Then an application, under arbitrary coloring which gives matching on complete graph $$n+1$$ vertices we consider search colored from set graph. show that finds within...