Negative closed walks in signed graphs: A note

10/14/2019
by   Andrzej Szepietowski, et al.
0

Recently Naserasr, Sopena, and Zaslavsky [R. Naserasr, É. Sopena, T. Zaslavsky,Homomorphisms of signed graphs: An update, arXiv: 1909.05982v1 [math.CO] 12 Sep 2019.] published a report on closed walks in signed graphs. They gave a characterization of the sets of closed walks in a graph G which corespond to the set of negative walks in some signed graph on G. In this note we show that their characterization is not valid and give a new characterization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2023

Permutation Inequalities for Walks in Graphs

Using spectral graph theory, we show how to obtain inequalities for the ...
research
05/08/2022

Orientations and cycles in supersingular isogeny graphs

The paper concerns several theoretical aspects of oriented supersingular...
research
06/03/2019

Generalizations of k-Weisfeiler-Leman partitions and related graph invariants

The family of Weisfeiler-Leman equivalences on graphs is a widely studie...
research
12/04/2019

Robotic Surveillance Based on the Meeting Time of Random Walks

This paper analyzes the meeting time between a pair of pursuer and evade...
research
05/13/2019

Can NetGAN be improved by short random walks originated from dense vertices?

Graphs are useful structures that can model several important real-world...
research
11/02/2015

From random walks to distances on unweighted graphs

Large unweighted directed graphs are commonly used to capture relations ...
research
02/07/2018

Learning Role-based Graph Embeddings

Random walks are at the heart of many existing network embedding methods...

Please sign up or login with your details

Forgot password? Click here to reset