✦ LIBER ✦

On functions with strongly closed graphs

✍ Scribed by T. Noiri

Book ID: 105394186
Publisher: Akadmiai Kiad
Year: 1978
Tongue: English
Weight: 249 KB
Volume: 32
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01902194

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Functions with closed graphs and strongl

Functions with closed graphs and strongly closed graphs in fuzzy neighbourhood spaces

✍ A.A. Allam; K.M. Abd El-Hakeim 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 371 KB

A Distance-Regular Graph with Strongly C

A Distance-Regular Graph with Strongly Closed Subgraphs

✍ Akira Hiraki 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 56 KB

On bipartite distance-regular graphs wit

On bipartite distance-regular graphs with a strongly closed subgraph of diameter three

✍ Qian Kong; Kaishun Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 216 KB

On strongly asymmetric graphs

✍ Mirko Lepović 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Let G be an arbitrary simple graph of order n. G is called strongly asymmetric if all induced overgraphs of G of order (n + 1) are nonisomorphic. In this paper we give some properties of such graphs and prove that the class 6ec of all connected strongly asymmetric graphs is infinite. In this paper

On strongly regular graphs with μ ≥ 2

✍ Bhaskar Bagchi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 59 KB

On graphs with strongly independent colo

On graphs with strongly independent color-classes

✍ A. Gyárfás; T. Jensen; M. Stiebitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract We prove that for every __k__ there is a __k__‐chromatic graph with a __k__‐coloring where the neighbors of each color‐class form an independent set. This answers a question raised by N. J. A. Harvey and U. S. R. Murty [4]. In fact we find the smallest graph __G__~__k__~ with the requir