Results 31 to 40 of about 312,012 (172)
Mathematics of Computation, 1979 Let p n {p_n} denote the nth prime. The prime number graph is the set of lattice points ( n , p n ) (n,{p_n}) , n = 1 , 2 , … n = 1,2 ...
openaire +1 more source
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
Mathematics, 2018 Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in &Gamma ...
Hossein Moradi +2 more
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
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. +2 more
doaj +1 more source
Graphs having no quantum symmetry [PDF]
, 2006 We consider circulant graphs having $p$ vertices, with $p$ prime. To any such graph we associate a certain number $k$, that we call type of the graph. We prove that for $p>>k$ the graph has no quantum symmetry, in the sense that the quantum automorphism ...
Banica, Teodor +2 more
core +4 more sources
Discrete Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Determination of the prime bound of a graph [PDF]
, 2013 Given a graph $G$, a subset $M$ of $V(G)$ is a module of $G$ if for each $v\in V(G)\setminus M$, $v$ is adjacent to all the elements of $M$ or to none of them. For instance, $V(G)$, $\emptyset$ and $\{v\}$ ($v\in V(G)$) are modules of $G$ called trivial.
Boussaïri, Abderrahim, Ille, Pierre
core +4 more sources
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