91,250 research outputs found
A characterization of consistent marked graphs
A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterzing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterization is given in terms of fundamental cycles of a cycle basis
Characterization of Line-Consistent Signed Graphs
The line graph of a graph with signed edges carries vertex signs. A
vertex-signed graph is consistent if every circle (cycle, circuit) has positive
vertex-sign product. Acharya, Acharya, and Sinha recently characterized
line-consistent signed graphs, i.e., edge-signed graphs whose line graphs, with
the naturally induced vertex signature, are consistent. Their proof applies
Hoede's relatively difficult characterization of consistent vertex-signed
graphs. We give a simple proof that does not depend on Hoede's theorem as well
as a structural description of line-consistent signed graphs.Comment: 5 pages. V2 defines sign of a walk and corrects statement of Theorem
4 ("is balanced and" was missing); also minor copyeditin
Bipartite partial duals and circuits in medial graphs
It is well known that a plane graph is Eulerian if and only if its geometric
dual is bipartite. We extend this result to partial duals of plane graphs. We
then characterize all bipartite partial duals of a plane graph in terms of
oriented circuits in its medial graph.Comment: v2: minor changes. To appear in Combinatoric
Total Minimal Dominating Signed Graph
Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is positive (friendly, like, etc.) or negative (hostile, dislike, etc.). Such a network S is called a signed graph. Signed graphs are much studied in literature because of their extensive use in modeling a variety socio-psychological process and also because of their interesting connections with many classical mathematical systems
Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups
We discuss functions from edges and vertices of an undirected graph to an
Abelian group. Such functions, when the sum of their values along any cycle is
zero, are called balanced labelings. The set of balanced labelings forms an
Abelian group. We study the structure of this group and the structure of two
closely related to it groups: the subgroup of balanced labelings which consists
of functions vanishing on vertices and the corresponding factor-group. This
work is completely self-contained, except the algorithm for obtaining the
3-edge-connected components of an undirected graph, for which we make
appropriate references to the literature.Comment: 22 page
Negation Switching Equivalence in Signed Graphs
Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8]. We consider only finite, simple graphs free from self-loops
Simultaneous Representation of Proper and Unit Interval Graphs
In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study of simultaneous representations is the sunflower case where all objects share the same common structure. While the recognition problem for general simultaneous interval graphs - the simultaneous version of arguably one of the most well-studied graph classes - is NP-complete, the complexity of the sunflower case for three or more simultaneous interval graphs is currently open. In this work we settle this question for proper interval graphs. We give an algorithm to recognize simultaneous proper interval graphs in linear time in the sunflower case where we allow any number of simultaneous graphs. Simultaneous unit interval graphs are much more "rigid" and therefore have less freedom in their representation. We show they can be recognized in time O(|V|*|E|) for any number of simultaneous graphs in the sunflower case where G=(V,E) is the union of the simultaneous graphs. We further show that both recognition problems are in general NP-complete if the number of simultaneous graphs is not fixed. The restriction to the sunflower case is in this sense necessary
- …