𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Index of Primitivity of the Disjunction and the Composition of Two Directed Graphs

✍ Scribed by Maria Kwaśnik

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
247 KB
Volume
134
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On bandwidth and edgesum for the composi
On bandwidth and edgesum for the composition of two graphs
✍ Jiuqiang Liu; Kenneth Williams 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The composition of two graphs G and H, written G[H], is the graph with vertex set V(G) x V(H) and with (u,, uI) adjacent to (ul, ul) if either u1 is adjacent to IQ in G or u1 = u2 and ul is adjacent to v2 in H. In this paper, we investigate the bandwidth problem for the composition of two graphs and

Primitivity and independent sets in dire
Primitivity and independent sets in direct products of vertex-transitive graphs
✍ Huajun Zhang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive graphs. As a consequence of our main results, we positively solve

On the k-index of graphs
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

The cochromatic index of a graph
The cochromatic index of a graph
✍ Lowell Beineke; Richard Ringeisen; H.Joseph Straight 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 684 KB

We discuss partitions of the edge set of a graph into subsets which are uniform in their internal relationships; i.e., the edges are independent, they are incident with a common vertex (a star), or three edges meet in a triangle. We define the cochromatic index z'(G) of G to be the minimum number of

Subdivisions and the chromatic index of
Subdivisions and the chromatic index of r-graphs
✍ K. Kilakos; F. B. Shepherd 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 625 KB

Let T2 be the graph obtained from the Petersen graph by first deleting a vertex and then contracting an edge incident to a vertex of degree two. We give a simple characterization of the graphs that contain no subdivision of T2. This characterization is used to show that if every planar r-graph is r-