✦ LIBER ✦

Zeta functions of line, middle, total graphs of a graph and their coverings

✍ Scribed by Jin Ho Kwak; Iwao Sato

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 257 KB
Volume: 418
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.01.033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Zeta Functions of Graph Coverings

✍ Hirobumi Mizuno; Iwao Sato 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 123 KB

We give a decomposition formula for the zeta function of a group covering of a graph.

The decompositions of line graphs, middl

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

✍ Jin Akiyama; Takashi Hamada 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons

Zeta Functions of Finite Graphs and Cove

Zeta Functions of Finite Graphs and Coverings, Part II

✍ H.M. Stark; A.A. Terras 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Galois theory for normal unramified coverings of finite irregular graphs (which may have multiedges and loops) is developed. Using Galois theory we provide a construction of intermediate coverings which generalizes the classical Cayley and Schreier graph constructions. Three different analogues of A

Total matchings and total coverings of g

Total matchings and total coverings of graphs

✍ Y. Alavi; M. Behzad; L. M. Lesniak-Foster; E. A. Nordhaus 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract In graph theory, the related problems of deciding when a set of vertices or a set of edges constitutes a maximum matching or a minimum covering have been extensively studied. In this paper we generalize these ideas by defining total matchings and total coverings, and show that these set

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

On total covering and matching of graphs

✍ A Meir 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 219 KB