On the tree representation of chordal graphs
Copyright policy )On the tree representation of chordal graphs
AbstractWe introduce the notion of the boundary clique and the k‐overlap clique graph and prove the following: Every incomplete chordal graph has two nonadjacent simplicial vertices lying in boundary cliques. An incomplete chordal graph G is k‐connected if and only if the k‐overlap clique graph gk(G) is connected. We give an algorithm to construct a clique tree of a connected chordal graph and characterize clique trees of connected chordal graphs using the algorithm.
- Gunma University Japan
Extremal problems in graph theory, Graph theory (including graph drawing) in computer science, overlap clique graph, clique trees, chordal graphs, Paths and cycles, Software, source code, etc. for problems pertaining to combinatorics, Trees, tree representation
Extremal problems in graph theory, Graph theory (including graph drawing) in computer science, overlap clique graph, clique trees, chordal graphs, Paths and cycles, Software, source code, etc. for problems pertaining to combinatorics, Trees, tree representation
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).43 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!