Strong matching preclusion for n-dimensional torus networks
Copyright policy )Strong matching preclusion for n-dimensional torus networks
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Minjiang University China (People's Republic of)
- Xinjiang University China (People's Republic of)
torus networks, Network design and communication in computer systems, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, perfect matching, almost perfect matching, Small world graphs, complex networks (graph-theoretic aspects), strong matching preclusion
torus networks, Network design and communication in computer systems, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, perfect matching, almost perfect matching, Small world graphs, complex networks (graph-theoretic aspects), strong matching preclusion
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).8 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.Top 10%
Citations provided by BIP!Popularity provided by BIP!