Results 31 to 40 of about 782,126 (230)
ON THE PRIME GRAPH OF SIMPLE GROUPS [PDF]
Bulletin of the Australian Mathematical Society, 2014 AbstractLet $G$ be a finite group, let ${\it\pi}(G)$ be the set of prime divisors of $|G|$ and let ${\rm\Gamma}(G)$ be the prime graph of $G$. This graph has vertex set ${\it\pi}(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an element of order $rs$.
Burness, Tim C, Covato, Elisa
openaire +3 more sources
Classifying families of character degree graphs of solvable groups [PDF]
International Journal of Group Theory, 2019 We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion.
Mark Bissler, Jacob Laubacher
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
$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
Discrete Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Wiener index of graphs over rings: a survey
AKCE International Journal of Graphs and Combinatorics, 2022 This article presents a survey of results consisting of the Wiener index of graphs associated with commutative rings. In particular, we focus on zero-divisor graphs, unit graphs, total graphs and prime graphs.
T. Asir +3 more
doaj +1 more source
Introduction to dominated edge chromatic number of a graph [PDF]
Opuscula Mathematica, 2021 We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph \(G\), is a proper edge coloring of \(G\) such that each color class is dominated by at least one edge of \(G\).
Mohammad R. Piri, Saeid Alikhani
doaj +1 more source
Supermagic Coverings of Some Simple Graphs [PDF]
, 2011 Showing that edge amalgamation of a finite collection of graphs isomorphic to any 2-connected simple graph H is H ...
Selvagopal, P., Jeyanthi, P.
core +1 more source
Prime labeling in the context of web graphs without center
AKCE International Journal of Graphs and Combinatorics, 2021 A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
A. N. Kansagara, S. K. Patel
doaj +1 more source
Recognition by degree prime-power graph and order of some characteristically simple groups [PDF]
AUT Journal of Mathematics and Computing, 2021 In this paper, by the order of a group and triviality of $O_p(G)$ for some prime $p$, we give a new characterization for some characteristically simple groups. In fact, we prove that if {$p \in \{5, 17, 23, 37, 47, 73\}$ and $n \leqslant p$, where $n$ is
Afsane Bahri +2 more
doaj +1 more source