๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On perfect neighborhood sets in graphs

โœ Scribed by Gerd H. Fricke; Teresa W. Haynes; Sandra Hedetniemi; Stephen T. Hedetniemi; Michael A. Henning

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
279 KB
Volume
199
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Neighborhood perfect graphs
Neighborhood perfect graphs
โœ J Lehel; Zs Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 595 KB

The notion of neighborhood perfect graphs is introduced here as follows. Let G be a graph, ~N(G) denote the maximum number of edges such that no two of them belong to the same subgraph of G induced by the (closed) neighborhood of some vertex; let PN(G) be the minimum number of vertices whose neighbo

Nearly perfect sets in graphs
Nearly perfect sets in graphs
โœ Jean E. Dunbar; Frederick C. Harris Jr; Sandra M. Hedetniemi; Stephen T. Hedetni ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 871 KB

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 efficient dominating sets. We say a nearly perfect set S is 1-minimal

Split-Neighborhood Graphs and the Strong
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture
โœ F. Maffray; M. Preissmann ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 649 KB

We introduce the class of graphs such that every induced subgraph possesses a vertex whose neighbourhood can be split into a clique and a stable set. We prove that this class satisfies Berge's strong perfect graph conjecture. This class contains several well-known classes of (perfect) graphs and is

Independent perfect domination sets in C
Independent perfect domination sets in Cayley graphs
โœ Jaeun Lee ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 92 KB ๐Ÿ‘ 1 views

## Abstract In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube __Q~n~__ has an independent perfect domination set if and only if __Q~n~__ i

Neighborhood conditions for balanced ind
Neighborhood conditions for balanced independent sets in bipartite graphs
โœ Denise Amar; Stephan Brandt; Daniel Brito; Oscar Ordaz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 319 KB

Let G be a balanced bipartite graph of order 2n and minimum degree 6(G)>~3. If, for every balanced independent set S of four vertices, IN(S)I >n then G is traceable, the circumference is at least 2n -2 and G contains a 2-factor (with only small order exceptional graphs for the latter statement). If