Displaying similar documents to “Cut-off for large sums of graphs”

Bounds for the distance energy of a graph

Harishchandra S. Ramane, Deepak S. Revankar, Ivan Gutman, Siddani Bhaskara Rao, B. Devadas Acharya, Hanumappa B. Walikar (2008)

Kragujevac Journal of Mathematics

Similarity:

Derived graphs of some graphs

Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)

Kragujevac Journal of Mathematics

Similarity:

Puzzles of Quasi-Finite Type, Zeta Functions and Symbolic Dynamics for Multi-Dimensional Maps

Jérôme Buzzi (2010)

Annales de l’institut Fourier

Similarity:

Entropy-expanding transformations define a class of smooth dynamics generalizing interval maps with positive entropy and expanding maps. In this work, we build a symbolic representation of those dynamics in terms of puzzles (in Yoccoz’s sense), thus avoiding a connectedness condition, hard to satisfy in higher dimensions. Those puzzles are controled by a «constraint entropy» bounded by the hypersurface entropy of the aforementioned transformations. The analysis of those puzzles...