All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 9 Next

Displaying 161 – 180 of 298

Showing per page

Graph fibrations, graph isomorphism, and PageRank

Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna (2006)

RAIRO - Theoretical Informatics and Applications

PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...

Graph Monoids.

F.W. Roush, K.H. Kim, L.G. Makar-Limanov (1982)

Semigroup forum

Graph operations and neighbor-integrity

Alpay Kırlangıc (2004)

Mathematica Bohemica

Let G be a graph. A vertex subversion strategy of G , say S , is a set of vertices in G whose closed neighborhood is removed from G . The survival-subgraph is denoted by G / S . The Neighbor-Integrity of G , N I ( G ) , is defined to be N I ( G ) = min S ⊆ V ( G ) { | S | + c ( G / S ) } , where S is any vertex subversion strategy of G , and c ( G / S ) is the maximum order of the components of G / S . In this paper we give some results connecting the neighbor-integrity and binary graph operations.

Graphes h - maximaux

M. Chein (1970)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Currently displaying 161 – 180 of 298