✦ LIBER ✦

On indexable graphs

✍ Scribed by S. Arumugam; K.A. Germina

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 240 KB
Volume: 161
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00234-n

No coin nor oath required. For personal study only.

✦ Synopsis

Let G = (V, E) be a (p, q) graph. G is said to be strongly indexable if there exists a bijection f: V --* {0, 1,2 ..... p -1} such that f+(E) = {1,2 ..... q}, where f+(uv) =f(u) +f(v) for any edge uv ~ E. G is said to be indexable if f+ is injective on E. In this paper we construct classes of strongly indexable unicyclic graphs. We also prove that trees and unicyclic graphs are indexable.

📜 SIMILAR VOLUMES

Strongly indexable graphs

✍ B.D. Acharya; S.M. Hegde 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Acharya, B.D. and S.M. Hegde, Strongly indexable graphs, Discrete Mathematics 93 (1991) 123-129. A (p, q)-graph G = (V, E) is said to be strongly k-indexable if it admits a strong k-indexer viz., an injective function f : V -{C, 1, 2, . . . , p -1) such that f(x)+f(y)=f+(xy)Ef+(E)={k,k+l,k+2,.. . ,

On the k-index of graphs

✍ Juraj Bosák 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 540 KB

Almtngt. Gi~ a ter~ph, p~tn every two vt~rticet which me 5t a dhtance tugate¢ than a fixed intelget k t>l) by a new path of lenltth k. Thus a laaph tranlfor:nati~n ts defined. The least number of itaslttior~ of tht, tr;m~l'ofmalion Such that the last it~rJfion does not change the graph. et called th

On the hamiltonian index of a graph

✍ Marko LovrečičSaražin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 217 KB

On line graphs and the hamiltonian index

✍ Ronald J. Gould 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 812 KB

## An extension of CI theorem of Chamhnd and Wall is obtained and, with it, a bound on the lamiltoniau index h(G) of a connected graph G (other than a path) is determined. As a tonsequence, it is Fhown that if G is homogeneously traceable, then h(Gj ~2.

On the oriented chromatic index of orien

On the oriented chromatic index of oriented graphs

✍ Pascal Ochem; Alexandre Pinlou; Éric Sopena 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

## Abstract A homomorphism from an oriented graph __G__ to an oriented graph __H__ is a mapping $\varphi$ from the set of vertices of __G__ to the set of vertices of __H__ such that $\buildrel {\longrightarrow}\over {\varphi (u) \varphi (v)}$ is an arc in __H__ whenever $\buildrel {\longrightarrow}

On the pseudoachromatic index of the com

On the pseudoachromatic index of the complete graph

✍ M. Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros;; Ricardo Strausz 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

Let q = 2 be, for some ∈ N, and let n = q 2 +q +1. By exhibiting a complete coloring of the edges of K n , we show that the pseudoachromatic number (G n ) of the complete line graph G n = L(K n )-or the pseudoachromatic index of K n , if you will-is at least q 3 +q. This bound improves the implicit