𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degrees in a digraph whose nodes are graphs

✍ Scribed by Krystyna T. Balińska; Louis V. Quintas

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
609 KB
Volume
150
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Continuous k-to-1 functions between comp
Continuous k-to-1 functions between complete graphs whose orders are of a different parity
✍ John Baptist Gauci; Anthony J. W. Hilton 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A function between graphs is k-to-1 if each point in the codomain has precisely k pre-images in the domain. Given two graphs, G and H, and an integer k ≥ 1, and considering G and H as subsets of R 3 , there may or may not be a k-to-1 continuous function (i.e. a k-to-1 map in the usual topological se

Degree sum for a triangle in a graph
Degree sum for a triangle in a graph
✍ Genghua Fan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 379 KB 👁 1 views

Let %(n; e) denote the class of graphs on n vertices and e edges. Define f(n, e) = min max{C:=, d(u,):{u,, up, uJ} induces a triangle in G}, where the maximum is taken over all triangles in the graph G and the minimum is taken over all G in %(n; e). From Turan's theorem, f(n, e) = 0 if e 5 n 2 / 4 ;

Hamiltonian cycles and paths in Cayley g
Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey
✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced

On the sum of all distances in a graph o
On the sum of all distances in a graph or digraph
✍ Ján Plesník 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 870 KB

The transmission of a graph or digraph G is the sum of all distances in G. StFict bounds on the transmission are collected and extended for several classes of graphs and digraphs. For example, in the class of 2connected or Z-edge-mnnected graphs of order n, the maximal transmission is realized only