Results 81 to 90 of about 1,383 (108)

Computing degree based topological indices of algebraic hypergraphs. [PDF]

Heliyon
Alali AS, Sözen EÖ, Abdioğlu C, Ali S, Eryaşar E.   +4 more
europepmc   +1 more source

A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups. [PDF]

Math Ann
Gollin JP, Hendrey K, Kwon OJ, Oum SI, Yoo Y.   +4 more
europepmc   +1 more source

A Full Halin Grid Theorem. [PDF]

Discrete Comput Geom
Georgakopoulos A, Hamann M.
europepmc   +1 more source

Parity Property of Hexagonal Sliding Puzzles. [PDF]

Mathematica (N Y)
Estévez M, Karpman R, Roldán É.
europepmc   +1 more source

Multiples of left loops and vertex-transitive graphs

Open Mathematics, 2005
Mwambene Eric
doaj   +1 more source

On Cayley graphs of completely 0-simple semigroups

Open Mathematics, 2013
Wang Shoufeng, Li Yinghui
doaj   +1 more source

Note on group distance magic complete bipartite graphs

Open Mathematics, 2014
Cichacz Sylwia
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

[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

On linear and residual properties of graph products.

Michigan Mathematical Journal, 1999
Tim Hsu, Daniel T Wise
exaly  

Possible Brauer trees

Illinois Journal of Mathematics, 1984
Walter Feit
exaly