A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
Copyright policy )A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Novi Sad Serbia
thin triangular grid cylinder graph, Graphs and linear algebra (matrices, eigenvalues, etc.), contractible Hamiltonian cycles, contractible hamiltonian cycles, secondary 05c50, 05a15, Exact enumeration problems, generating functions, primary 05c30, Enumeration in graph theory, generating functions, QA1-939, Paths and cycles, Mathematics
thin triangular grid cylinder graph, Graphs and linear algebra (matrices, eigenvalues, etc.), contractible Hamiltonian cycles, contractible hamiltonian cycles, secondary 05c50, 05a15, Exact enumeration problems, generating functions, primary 05c30, Enumeration in graph theory, generating functions, QA1-939, Paths and cycles, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!