Results 41 to 50 of about 3,126 (152)

On the distance eigenvalues of Cayley graphs

پژوهش‌های ریاضی, 2022
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj  

A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\&$ -2 isomorphic circulant graphs

Elspas and Turner \cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$ and Vilfred \cite{v96} gave its answer by defining Type-2 isomorphism of $C_n(R)$ w.r.t. $m$ $\ni$ $m$ = $\gcd(n, r) > 1$, $r\in R$ and $r,n\in\mathbb{N}$ and studied such graphs for $m$ = 2 in \cite{v13,v20}.
Kamalappan, Vilfred, Peraprakash, Wilson
openaire   +2 more sources

On Isomorphism Classes and Invariants of Low Dimensional Complex Filiform Leibniz Algebras (PART 1)

, 2007
The paper aims to investigate the classification problem of low dimensional complex none Lie filiform Leibniz algebras. There are two sources to get classification of filiform Leibniz algebras. The first of them is the naturally graded none Lie filiform Leibniz algebras and the another one is the naturally graded filiform Lie algebras.
Rakhimov, I. S., Husain, S. K. Said
openaire   +2 more sources

Same-diff? Conceptual similarities between gauge transformations and diffeomorphisms. Part I: Symmetries and isomorphisms

, 2021
The following questions are germane to our understanding of gauge-(in)variant quantities and physical possibility: how are gauge transformations and spacetime diffeomorphisms understood as symmetries, in which ways are they similar, and in which are they different?
openaire   +2 more sources

On isomorphism classes and invariants of low dimensional complex filiform Leibniz algebras (part 2)

, 2008
15 ...
Rakhimov, I. S., Husain, S. K. Said
openaire   +2 more sources

Isomorphism, Task Dependence, and the Multiple Meaning Theory of Neural Coding (Part 2 of 2)

Neurosignals, 1992
The neural coding problem is defined and several possible answers to it are reviewed. A widely accepted answer descends from early suggestions that neural activity, in general, is isomorphic with ...
openaire   +1 more source

A study on Type-2 isomorphic circulant graphs. Part 7: Isomorphism series, digraph and graph of $C_n(R)$

This study is the $7^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. In this study, we define {\em isomorphic set}, {\em isomorphism series}, {\em isomorphism digraph} $\mathcal{D}$ or {\em isomorphism diagram} and {\em isomorphism graph} $\mathcal{G}$ of circulant graphs and obtain these ...
openaire   +2 more sources

A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96

This study is the $5^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 4. Here, we study Type-2 isomorphic circulant graphs of $C_{48}(r_1,r_2,r_3)$, $C_{81}(r_1,r_2,r_3)$ and $C_{96}(r_1,r_2,r_3,r_4)$.
openaire   +2 more sources

Uniform finite presentation for groups of polynomial growth

Discrete Analysis
Uniform finite presentation for groups of polynomial growth, Discrete Analysis 2025:1, 29 pp. Let $G$ be a finitely generated infinite group with generators $a_1,\dots,a_k$. The _ball of radius_ $r$ in $G$ is defined to be the set of all elements of $G$
Philip Easo, Tom Hutchcroft
doaj   +1 more source

A study on Type-2 isomorphic circulant graphs. Part 2: Type-2 isomorphic circulant graphs of orders 16, 24, 27

This article is an extension and modified article of its previous ...
openaire   +2 more sources