No label defined (Q3222229)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3887734
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3887734

      Statements

      0 references
      1984
      0 references
      signed graph
      0 references
      balanced graphs
      0 references
      clusterable signed graph
      0 references
      cobalance of a signed graph
      0 references
      [For the entire collection see Zbl 0547.00011.] A graph is called signed, if to each of its edges a sign \(+\) or - is assigned. If every circuit in a signed graph G contains an even number of negative edges, this graph is called balanced. In the paper some characterization theorems for balanced graphs are proved. They use the concept of a cocycle, i.e. the set of all edges which are incident to a given vertex. At the end two related concepts are described, namely the clusterable signed graph and the cobalance of a signed graph.
      0 references

      Identifiers