๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new Bartholdi zeta function of a digraph

โœ Scribed by Hirobumi Mizuno; Iwao Sato


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
185 KB
Volume
423
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Ihara zeta functions of digraphs
โœ Matthew D. Horton ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB
The Path-Cycle Symmetric Function of a D
โœ Timothy Y. Chow ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 885 KB

## Introduction Recently, Stanley [21] has defined a symmetric function generalization of the chromatic polynomial of a graph. Independently, Chung and Graham have defined a digraph polynomial called the cover polynomial which is closely related to the chromatic polynomial of a graph (in fact, as

A two variable Riemann zeta function
โœ C.F. Woodcock ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 366 KB
A line digraph of a complete bipartite d
โœ Juan Liu; Lin Sun; Jixiang Meng ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 310 KB

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum outdegrees (d 1 , d 2 ) of its partite sets of vertices. In this work, we defi

A Note on the Zeta Function of a Graph
โœ Sam Northshield ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 113 KB

The number of spanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs. ## 1998 Academic Press Let G be a finite graph. The complexity of G, denoted }, is the num

A Probabilistic Interpretation of the Hu
โœ R.A. Lippert ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 154 KB

Presented in a continuous extension of a measure used by Sol Golomb to define a probability on the sample space of natural numbers. The extension is a probability measure which holds several characteristic in common with Golomb's measure but on the set \((1, \infty)\). I have proven a theorem which