✦ LIBER ✦

Generalized graph entropies

✍ Scribed by Matthias Dehmer; Abbe Mowshowitz

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 177 KB
Volume: 17
Category: Article
ISSN: 1076-2787
DOI: 10.1002/cplx.20379

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On generalized graph colorings

✍ Jason I. Brown; Derek G. Corneil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

Given a property P, graph G. and k 2 0, a P k-coloring is a function 7r: V(G) + { I , ... , k) such that the subgraph induced by each color class has property P; x ( G : P ) is the least k, for which G has a P k-coloring. We investigate here the theory of P colorings. Generalizations of the wellknow

The generalized diameter of a graph

✍ Chih-Kang Eric Chen; R. S. Garfinkel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract We generalize the concept of the diameter of a graph __G__ = (__N, A__) to allow for location of points not on the nodes. It is shown that there exists a finite set of candidate points which determine this __generalized diameter.__ Given the matrix of shortest paths, an __o__ (|__A__|^2

Graph generators

✍ Milan Randić; Wayne L. Woodworth; Alexander F. Kleiner; Haruo Hosoya 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 942 KB

We consider the construction of highly symmetrical vertex transitive graphs. Some such graphs represent the degenerate rearrangements in which a molecule or an ion is formed by breaking and making bonds so that the final and the initial skeleton is identical. The approach is closely related to Cayle

On A-Compact Operators, Generalized Entr

On A-Compact Operators, Generalized Entropy Numbers and Entropy Ideals

✍ Bernd Carl; Irmtraud Stephani 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 774 KB

Generalized line graphs

✍ Dragoš Cvetkovic̀; Michael Doob; Slobodan Simic̀ 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

## Abstract Generalized line graphs extend the ideas of both line graphs and cocktail party graphs. They were originally motivated by spectral considerations. in this paper several (nonspectral) classical theorems about line graphs are extended to generalized line graphs, including the derivation a

Generalized steinhaus graphs

✍ Neal Brand; Margaret Morton 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 584 KB

## Abstract A generalized Steinhaus graph of order __n__ and type __s__ is a graph with __n__ vertices whose adjacency matrix (__a__~i,j~) satisfies the relation magnified image where 2 ≦__i__≦__n__−1, __i__ + __s__(__i__ − 1 ≦ __j__ ≦ __n__, __c__~r,i,j~ ϵ {0,1} for all 0 ≦ __r__ ≦ __s__(__i__) −1