𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on a generalization of eigenvector centrality for bipartite graphs and applications

✍ Scribed by Peteris Daugulis

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
88 KB
Volume
59
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on bipartite subgraphs of triangl
A note on bipartite subgraphs of triangle-free regular graphs
✍ S. C. Locke πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

On a product dimension of bipartite grap
On a product dimension of bipartite graphs
✍ S. Poljak; D. RΓΆdl; A. Pultr πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 437 KB πŸ‘ 1 views
A Note on Almost Regular Graphs
A Note on Almost Regular Graphs
✍ M. Of Hofmeister Munich πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.

A note on coverings of plane graphs
A note on coverings of plane graphs
✍ Eduardo Rivera-Campo πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 175 KB πŸ‘ 1 views

## Abstract For any plane graph __G__ the number of edges in a minimum edge covering of the faces of __G__ is at most the vertex independence number of __G__ and the numbre of vertices in a minimum vertex covering of the faces of __G__ is at most the edge independence number of __G__. Β© 1995 John W