✦ LIBER ✦

Calculation of the Accessibility Number and the Neighbor Integrity of a Graph

✍ Scribed by P. Dundar; A. Aytac; V. Aytac

Publisher: SP MAIK Nauka/Interperiodica
Year: 2005
Tongue: English
Weight: 276 KB
Volume: 78
Category: Article
ISSN: 0001-4346
DOI: 10.1007/s11006-005-0166-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of integral circ

On the chromatic number of integral circulant graphs

✍ Aleksandar Ilić; Milan Bašić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Integral circulant graphs are a generalization of unitary Cayley graphs, recently studied by Klotz and Sander. The integral circulant graph X n (D) has vertices 0, 1, . . . , n -1, and two vertices a and b are adjacent iff gcd(xy, n) ∈ D, where D ⊆ {d : Circulant graphs have various applications in

The discipline number of a graph

✍ V. Chvátal; W. Cook 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

The hull number of a graph

✍ Martin G Everett; Stephen B Seidman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 379 KB

A set of points S of a graph is convex if any geodesic joining two points of S lies entirely within S. The convex hull of a set T of points is the smallest convex set that contains T. The hull number (h) of a graph is the cardinality of the smallest set of points whose convex hull is the entire grap

The bondage number of a graph

✍ John Frederick Fink; Michael S. Jacobson; Lael F. Kinch; John Roberts 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 654 KB

The geodetic number of a graph

✍ Frank Harary; Emmanuel Loukakis; Constantine Tsouros 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 406 KB

The basis number of a graph

✍ Edward F Schmeichel 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 353 KB