Superpositional graphs | Zendy

Ahti Peder | Zendy; Mati Tombak | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Superpositional graphs

Author(s) -

Ahti Peder,

Mati Tombak

Publication year - 2009

Publication title -

acta et commentationes universitatis tartuensis de mathematica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.276

H-Index - 6

eISSN - 2228-4699

pISSN - 1406-2283

DOI - 10.12697/acutm.2009.13.06

Subject(s) - indifference graph , combinatorics , chordal graph , mathematics , pathwidth , cograph , 1 planar graph , clique sum , split graph , maximal independent set , subclass , graph product , discrete mathematics , modular decomposition , graph , line graph , biology , antibody , immunology

The class of superpositional graphs, which is defined as the set of graphs whose elements are generated by superposition, is a subclass of binary graphs. The properties of superpositional graphs are investigated, and necessary and sufficient conditions found for a binarygraph to be a superpositional graph.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research