Properties and Recognition of Atom Graphs
The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees. A graph <i>G</i> is an atom graph if there is a graph whose atom graph is isomorphic to <i...
Main Authors: | Geneviève Simonet, Anne Berry |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-08-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/15/8/294 |
Similar Items
-
Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph
by: Anne Berry, et al.
Published: (2021-11-01) -
Clique roots of K4-free chordal graphs
by: Hossein Teimoori Faal
Published: (2019-04-01) -
End Simplicial Vertices in Path Graphs
by: Gutierrez Marisa, et al.
Published: (2016-05-01) -
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
by: Caria Pablo De, et al.
Published: (2014-08-01) -
on the number of cliques and cycles in graphs
by: Mojgan Emami, et al.
Published: (2013-06-01)