Results 31 to 40 of about 1,036,687 (287)

On Order Prime Divisor Graphs of Finite Groups

Discussiones Mathematicae - General Algebra and Applications, 2021
The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K., Maity Sunil K., Das Sumanta   +2 more
doaj   +1 more source

Reduced zero-divisor graphs of posets [PDF]

Transactions on Combinatorics, 2018
This paper investigates properties of the reduced zero-divisor graph of a poset. We show that a vertex is an annihilator prime ideal if and only if it is adjacent to all other annihilator prime ideals and there are always two annihilator prime ideals ...
Deiborlang Nongsiang, Promode Saikia
doaj   +1 more source

A new characterization of some characteristically simple groups [PDF]

AUT Journal of Mathematics and Computing, 2023
Let $G$ be a finite group and $\mathrm{cd}(G)$ be the set of irreducible complex character degrees of $G$. It was proved that some finite simple groups are uniquely determined by their orders and their degree graphs.
Zohreh Sayanjali
doaj   +1 more source

Edge-partitioning graphs into regular and locally irregular components [PDF]

Discrete Mathematics & Theoretical Computer Science, 2016
A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs.
Julien Bensmail, Brett Stevens
doaj   +1 more source

Total Colouring of New Classes of Subcubic graphs

Theory and Applications of Graphs, 2022
The total chromatic number of a graph $G$, denoted $\chi^{\prime\prime}(G)$, is the least number of colours needed to colour the vertices and the edges of $G$ such that no incident or adjacent elements (vertices or edges) receive the same colour.
Sethuraman G, Velankanni Anthonymuthu
doaj   +1 more source

Prime ideal graphs of commutative rings

Indonesian Journal of Combinatorics, 2022
Let R be a finite commutative ring with identity and P be a prime ideal of R. The vertex set is R - {0} and two distinct vertices are adjacent if their product in P. This graph is called the prime ideal graph of R and denoted by ΓP.
Haval Mohammed Salih, Asaad A. Jund
doaj   +1 more source

On finite groups with disconnected prime graph [PDF]

, 2013
All finite simple nonabelian groups that have the same prime graph as a Frobenius group or a 2-Frobenius group are found.
Mazurov, V. D., Zinov'eva, M. R.
core   +1 more source

PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS

Barekeng
Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph  with a vertex-set  and an edge-set .
Desi Rahmadani, Ardi Aldiansyah, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari   +4 more
doaj   +1 more source

Inverse Domination Parameters of Jump Graph

Ratio Mathematica, 2023
Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D.
S Santha, G.T Krishna Veni
doaj   +1 more source

‎$‎4‎$‎-Regular prime graphs of nonsolvable groups [PDF]

International Journal of Group Theory, 2020
Let $G$ be a finite group and $\cd(G)$ denote the character degree set for $G$. The prime graph $\DG$ is a simple graph whose vertex set consists of prime divisors of elements in $\cd(G)$, denoted $\rho(G)$.
Donnie Kasyoki, Paul Oleche
doaj   +1 more source