The zeta function of a hypergraph.
Storm, Christopher K. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Selberg's trace formula on the -regular tree and applications.”
The zeta function of a hypergraph.
Properties determined by the Ihara zeta function of a graph.
Cooper, Yaim (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bartholdi zeta functions of fractal graphs.
Sato, Iwao (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
Sebastian M. Cioabă, Xiaofeng Gu (2016)
Czechoslovak Mathematical Journal
Similarity:
The eigenvalues of graphs are related to many of its combinatorial properties. In his fundamental work, Fiedler showed the close connections between the Laplacian eigenvalues and eigenvectors of a graph and its vertex-connectivity and edge-connectivity. We present some new results describing the connections between the spectrum of a regular graph and other combinatorial parameters such as its generalized connectivity, toughness, and the existence of spanning trees with bounded degree. ...
Regular graphs and their spanning trees
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity:
A new spectral method for determining the number of spanning trees.
Cvetkovic, D.M., Gutman, I. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The Estrada Index: An Updated Survey
Ivan Gutman, Hanyuan Deng, Slavko Radenković (2011)
Zbornik Radova
Similarity:
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Fatemeh Alinaghipour Taklimi, Shaun Fallat, Karen Meagher (2014)
Special Matrices
Similarity:
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing...