Results 1 to 10 of about 122 (75)
Symmetric graphs of valency seven and their basic normal quotient graphs
We characterize seven valent symmetric graphs of order 2pqn2p{q}^{n} with ...
Pan Jiangmin, Huang Junjie, Wang Chao
doaj +1 more source
On the Non-Inverse Graph of a Group
Let (G, *) be a finite group and S = {u ∈ G|u ≠ u−1}, then the inverse graph is defined as a graph whose vertices coincide with G such that two distinct vertices u and v are adjacent if and only if either u * v ∈ S or v * u ∈ S.
Amreen Javeria, Naduvath Sudev
doaj +1 more source
Determining Number of Kneser Graphs: Exact Values and Improved Bounds [PDF]
The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial.
Angsuman Das, Hiranya Kishore Dey
doaj +1 more source
Remark on subgroup intersection graph of finite abelian groups
Let G be a finite group. The subgroup intersection graph Γ(G)\text{Γ}(G) of G is a graph whose vertices are non-identity elements of G and two distinct vertices x and y are adjacent if and only if |〈x〉∩〈y〉|>1|\langle x\rangle \cap \langle y\rangle
Zhao Jinxing, Deng Guixin
doaj +1 more source
The intersection graph of graded submodules of a graded module
In this article, we introduce and study the intersection graph of graded submodules of a graded module. Let MM be a left GG-graded RR-module. We define the intersection graph of GG-graded RR-submodules of MM, denoted by Γ(G,R,M)\Gamma \left(G,R,M), to be
Alraqad Tariq
doaj +1 more source
Generalized Munn rings exist extensively in the theory of rings. The aim of this note is to answer when a generalized Munn ring is primitive (semiprimitive, semiprime and prime, respectively).
Guo Junying, Guo Xiaojiang
doaj +1 more source
Congruences and Hoehnke Radicals on Graphs
We motivate, introduce, and study radicals on classes of graphs. This concept, and the theory which is developed, imitates the original notion of a Hoehnke radical in universal algebra using congruences.
Broere Izak +2 more
doaj +1 more source
The structure fault tolerance of burnt pancake networks
One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The HH-structure connectivity and HH-substructure connectivity extend the classical connectivity and are more practical.
Ge Huifen, Ye Chengfu, Zhang Shumin
doaj +1 more source
On cospectrality of gain graphs
We define GG-cospectrality of two GG-gain graphs (Γ,ψ)\left(\Gamma ,\psi ) and (Γ′,ψ′)\left(\Gamma ^{\prime} ,\psi ^{\prime} ), proving that it is a switching isomorphism invariant.
Cavaleri Matteo, Donno Alfredo
doaj +1 more source
Path homology theory of edge-colored graphs
In this paper, we introduce the category and the homotopy category of edge-colored digraphs and construct the functorial homology theory on the foundation of the path homology theory provided by Grigoryan, Muranov, and Shing-Tung Yau.
Muranov Yuri V., Szczepkowska Anna
doaj +1 more source

