scientific article; zbMATH DE number 3979119

From MaRDI portal
Publication:3744202





[For the entire collection see Zbl 0585.00007.] The undirected resp. directed graphs considered are loop free, simple and finite. For a graph G let V(G) denote its vertex set and E(G) its edge set. E(G) is interpreted as a binary relation on V(G) here. The undirected case is characterized by a symmetric relation E(G). We study the relation of the automorphisms to the so-called X-sum.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744202)