✦ LIBER ✦

NEPS operations on cordial graphs

✍ Scribed by Walter W. Kirchherr

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 557 KB
Volume: 115
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90489-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Operations on fuzzy graphs

✍ John N. Mordeson; Peng Chang-Shyh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 651 KB

More powerful closure operations on grap

More powerful closure operations on graphs

✍ Yong-jin Zhu; Feng Tian; Xiao-tie Deng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1017 KB

Zhu, Y.-J., F. Tian and X.-T. Deng, More powerful closure operations on graphs, Discrete Mathematics 87 (1991) 197-214. Bondy and Chvatal have observed the following result: G = (V, E) is a simple graph of order n. If uu $ E and d(u) + d(u) 2 n, then G is Hamiltonian iff G + uu is Hamiltonian. Thus,

The bandwidth problem and operations on

The bandwidth problem and operations on graphs

✍ J Chvatalova; J Opatrny 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 479 KB

For a given graph G and vertices u, v in G let ,,,~ ~(.,~) G(-,,o) G~, o) denote the graph Gm ~ Va , ~s :, obtained from G by merging vertices u, v, adding edge (u, v), subdividing edge (u, v), contracting edge (u, v) of G, respectively. We give upper and lower bounds for the bandwidth of ~'~ ~(~'~)

The cordiality of one-point union of n c

The cordiality of one-point union of n copies of a graph

✍ Sze-Chin Shee; Yong-Song Ho 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 877 KB

Shee, S.-C. and Y.-S. Ho, The cordiality of one-point union of n copies of a graph, Discrete Mathematics 117 (1993) 225-243. In this paper we give an equivalent definition of a cordial graph. The definition implies a previous result of Cahit (1986); it also enables us to find infinite families of n

Iterating the branching operation on a d

Iterating the branching operation on a directed graph

✍ Athanasiadis, Christos A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

The branching operation D, defined by Propp, assigns to any directed graph G another directed graph D(G) whose vertices are the oriented rooted spanning trees of the original graph G. We characterize the directed graphs G for which the sequence δ(G) = (G, D(G), D 2 (G), . . .) converges, meaning tha

Approximating Spectral Invariants of Har

Approximating Spectral Invariants of Harper Operators on Graphs

✍ Varghese Mathai; Stuart Yates 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 185 KB

We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada [Sun]. A main result in this paper is that the spectral density function of DMLs associated to rational weight functions on graphs with a free