A characterization of substar graphs
Copyright policy )A characterization of substar graphs
The intersection graphs of stars in some tree are known as substar graphs. In this paper we give a characterization of substar graphs by the list of minimal forbidden induced subgraphs. This corrects a flaw in the main result of Chang, Jacobson, Monma and West (Subtree and substar intersection numbers, Discrete Appl. Math. 44, 205-220 (1993)) and this leads to a different list of minimal forbidden induced subgraphs.
7 pages
- University of Ulm Germany
chordal graph, intersection graph, Graph operations (line graphs, products, etc.), Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), substar graph
chordal graph, intersection graph, Graph operations (line graphs, products, etc.), Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), substar graph
selected citations These citations are derived from selected sources.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).2 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.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average 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!