Combinatorial Proof of the Identity for Cover Times on Finite Graphs

Interdisciplinary Information Sciences
doi 10.4036/iis.2010.111
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Graduate School of Information Sciences, Tohoku University

Related search

A Combinatorial Identity for the Derivative of a Theta Series of a Finite Type Root Lattice

Nagoya Mathematical Journal
Mathematics
2003English

On Limit Graphs of Finite Vertex-Primitive Graphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2007English

On Homologies in Finite Combinatorial Geometries

Bulletin of the Australian Mathematical Society
Mathematics
1975English

Hitting Times for Random Walks on Vertex-Transitive Graphs

Mathematical Proceedings of the Cambridge Philosophical Society
Mathematics
1989English

Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

On the Equational Graphs Over Finite Fields

Finite Fields and Their Applications
Theoretical Computer ScienceApplied MathematicsNumber TheoryEngineeringAlgebra
2020English

On the Circuit Cover Problem for Mixed Graphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2002English

Discordant Voting Processes on Finite Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2018English

A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy