Distance independence in graphs
Copyright policy ) J. Louis Sewell; Peter J. Slater;
Distance independence in graphs
For a set D of positive integers, we define a vertex set SV (G) to be D-independent if u,v 2 S implies the distance d(u,v) 㘲 D. The D-independence numberD(G) is the maximum cardinality of a D-independent set. In particular, the independence number �(G) = �{1}(G). Along with general results we consider, in particular, the odd-independence numberODD(G) where ODD = f1,3,5,...g.
- University of Alabama in Huntsville United States
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
selected citations
Citations provided by BIP!
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).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 0
Average
Average
Average
Published in a Diamond OA journal
Fields of Science (3) View all