AbstractA marked graph is a graph with a + or − sign on each vertex and is called consistent if each cycle has an even number of − signs. This concept is motivated by problems of communication networks and social networks. We present some new characterizations and recognition algorithms for consistent marked graphs
We develop a natural correspondence between marked graphs and balanced signed graphs, and exploit it...
AbstractWe characterize the edge-signed graphs in which every ‘significant’ positive closed walk (or...
AbstractA group-labeled graph is a graph whose vertices and edges have been assigned labels from som...
AbstractA marked graph is a graph in which each vertex is given a sign + or −. We call such a graph ...
AbstractA marked graph is a graph in which each vertex is given a sign + or −. We call such a graph ...
A marked graph is obtained from a graph by giving each point either a positive or a negative sign. B...
A marked graph is obtained from a graph by giving each point either a positive or a negative sign. B...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
Abstract. A signed graph is a graph in which every edge is designated to be either positive or negat...
Abstract. The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is...
Dedicated to a great man, Dr. B. Devadas Acharya (1947–2013) Abstract. A signed graph is a graph who...
AbstractA group-labeled graph is a graph whose vertices and edges have been assigned labels from som...
In this paper we strive towards a mathematical theory for "marked digraphs" in which the nodes are s...
We develop a natural correspondence between marked graphs and balanced signed graphs, and exploit it...
AbstractWe characterize the edge-signed graphs in which every ‘significant’ positive closed walk (or...
AbstractA group-labeled graph is a graph whose vertices and edges have been assigned labels from som...
AbstractA marked graph is a graph in which each vertex is given a sign + or −. We call such a graph ...
AbstractA marked graph is a graph in which each vertex is given a sign + or −. We call such a graph ...
A marked graph is obtained from a graph by giving each point either a positive or a negative sign. B...
A marked graph is obtained from a graph by giving each point either a positive or a negative sign. B...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consisten...
Abstract. A signed graph is a graph in which every edge is designated to be either positive or negat...
Abstract. The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is...
Dedicated to a great man, Dr. B. Devadas Acharya (1947–2013) Abstract. A signed graph is a graph who...
AbstractA group-labeled graph is a graph whose vertices and edges have been assigned labels from som...
In this paper we strive towards a mathematical theory for "marked digraphs" in which the nodes are s...
We develop a natural correspondence between marked graphs and balanced signed graphs, and exploit it...
AbstractWe characterize the edge-signed graphs in which every ‘significant’ positive closed walk (or...
AbstractA group-labeled graph is a graph whose vertices and edges have been assigned labels from som...
DOI
Add to ORKG