Results 111 to 120 of about 187 (132)

[2020]Primary 05C25, 37B99; Secondary 05C12, 68R10

This paper introduces a hierarchy of contractive endomorphisms on graphs, providing a rigorous framework for quantitative structural compression. We first define a general class of (m,n)-contractive endomorphisms, which map paths of length m to walks of length at most n, and prove that they form a semigroup under composition. To analyze the dynamics of
zeinab Shahini, Madjid Eshaghi Gordji
openaire   +1 more source

Parametric Shortest-Path Algorithms via Tropical Geometry

Mathematics of Operations Research, 2022
Michael Joswig, Benjamin Schröter
exaly  

On metric dimension of P(n, 2)ʘK1 graph

Journal of Discrete Mathematical Sciences and Cryptography, 2021
Abdul Qudair Baig, Manzoor Ahmad Zahid
exaly  

On the bounded partition dimension of some classes of convex polytopes

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Muhammad Azeem, Muhammad Faisal Nadeem, Adnan Khalil   +2 more
exaly  

Parabolic index and rough isometries

Hiroshima Mathematical Journal, 1993
Paolo M Soardi, Maretsugu Yamasaki
exaly  

Variance and concurrence in block designs, and distance in the corresponding graphs

Michigan Mathematical Journal, 2009
R A Bailey
exaly  

The partition dimension of circulant graphs

Quaestiones Mathematicae, 2018
Tomáš Vetrík
exaly  

Generalization of bipartite graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2020
P Siva Kota Reddy, P S Hemavathi
exaly  

On the metric dimension of generalized Petersen graphs

Quaestiones Mathematicae, 2013
Shabbir Ahmad, Imran Javaid, Muhammad Salman   +2 more
exaly