A Theorem on Indifference Graphs
Copyright policy )A Theorem on Indifference Graphs
An indifference graph P has as vertices a set of points on the real line, with an edge between every two points at most 1 apart. For every point x in P, we set N(x) to be the set of points that are adjacent to x. Fix an indifference graph P, and a positive integer k. Suppose that for every x in P, k divides |N(x)|. We show that the number of points in P is also divisible by k.
- San Diego State University United States
numerical monoid, interval graph, intersection graph, Commutative semigroups, indifference graph, Vertex degrees, numerical semigroup, Graphs and abstract algebra (groups, rings, fields, etc.)
numerical monoid, interval graph, intersection graph, Commutative semigroups, indifference graph, Vertex degrees, numerical semigroup, Graphs and abstract algebra (groups, rings, fields, etc.)
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).0 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!