منابع مشابه
Nearly perfect sets in graphs
In a graph G = (V; E), a set of vertices S is nearly perfect if every vertex in V ? S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and eecient dominating sets. We say a nearly perfect set S is 1-minimal if for every vertex u in S, the set S ? fug is not nearly perfect. Similarly, a nearly perfect s...
متن کاملPerl NEARLY PERFECT SETS IN PRODUCTS OF GRAPHS
The study of nearly perfect sets in graphs was initiated in [2]. Let S ⊆ V (G). We say that S is a nearly perfect set (or is nearly perfect) in G if every vertex in V (G)−S is adjacent to at most one vertex in S. A nearly perfect set S in G is called maximal if for every vertex u ∈ V (G) − S, S ∪ {u} is not nearly perfect in G. The minimum cardinality of a maximal nearly perfect set is denoted ...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملA Nearly Perfect Market?
Internet shopbots allow consumers to almost instantly compare prices and other characteristics from dozens of sellers via a single website. We estimate the magnitude of consumer search costs and benefits using data from a major shopbot for books. For the median consumer, the estimated benefit from simply scrolling down to search lower screens is $6.55. This amounts to about 60% of the observed ...
متن کاملNearly perfect fluidity
Shear viscosity is a measure of the amount of dissipation in a simple fluid. In kinetic theory shear viscosity is related to the rate of momentum transport by quasi-particles, and the uncertainty relation suggests that the ratio of shear viscosity η to entropy density s in units of h̄/kB is bounded by a constant. Here, h̄ is Planck’s constant and kB is Boltzmann’s constant. A specific bound has b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2013
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2013.v4.n3.a2