𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weighted Mean of a Pair of Graphs

✍ Scribed by Horst Bunke; Simon Günter

Book ID
106202982
Publisher
Springer Vienna
Year
2001
Tongue
English
Weight
212 KB
Volume
67
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circular colorings of weighted graphs
Circular colorings of weighted graphs
✍ Deuber, Walter A.; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 776 KB

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t . A t-circular coloring of (G,w) is a mapping A of the vertices of G to arcs of C such that A(%) n A(y) = 0 if (x, y) E E ( G ) and A(x) has l

Path covers of weighted graphs
Path covers of weighted graphs
✍ Genghua Fan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Let (G, w ) denote a simple graph G with a weight function w : €(G) -{0,1,2}. A path cover of (G, w ) is a collection of paths in G such that every edge e is contained in exactly w(e) paths of the collection. For a vertex u , w ( v ) is the sum of the weights of the edges incident with U ; U is call

The bases of weighted graphs
The bases of weighted graphs
✍ J. Alpin; R. Mubarakzianow 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 507 KB

There are many different mathematical objects (transitive reductions, minimal equivalent digraphs, minimal connected graphs, Hasse diagrams and so on) that are defined on graphs. Although they have different names they correspond to the same object if a weighted graph is defined more generally. The