Results 21 to 30 of about 912,801 (279)

A new characterization of some characteristically simple groups [PDF]

open access: yesAUT 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

Total Colouring of New Classes of Subcubic graphs

open access: yesTheory 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]

open access: yesInternational 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

Prime orientable graphs

open access: yesDiscrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

The prime number graph [PDF]

open access: yesMathematics of Computation, 1979
Let p n {p_n}
openaire   +1 more source

Wiener index of graphs over rings: a survey

open access: yesAKCE 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

Prime labeling in the context of web graphs without center

open access: yesAKCE 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

Finite groups whose character degree graphs coincide with their prime graphs [PDF]

open access: yes, 1967
Veliev, Oktay A. (Dogus Author)In the literature, there are several graphs related to a finite group G. Two of them are the character degree graph, denoted by ΔG), and the prime graph ΓG), In this paper we classify all finite groups whose character ...
Temha Erkoç   +10 more
core   +1 more source

A study on the number of edges of some families of graphs and generalized Mersenne numbers

open access: yesRatio Mathematica, 2022
The relationship between the Nandu sequence of the SM family of graphs and the Generalized Mersenne numbers is demonstrated in this study. Nandu sequences are related to the two families of SM sum graphs and SM Balancing graphs.
K.G. Sreekumar   +3 more
doaj   +1 more source

Introduction to dominated edge chromatic number of a graph [PDF]

open access: yesOpuscula 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

Home - About - Disclaimer - Privacy