Results 11 to 20 of about 33,236 (156)
Odd Prime Labeling For Some Arrow Related Graphs
Ratio Mathematica, 2023 In a graph G a mapping g is known as odd prime labeling , if g is a bijection from V to f1; 3; 5; ::::; 2jVj - 1g satisfying the condition that for each line xy in G the gcd of the labels of end points (g(x); g(y)) is one.
Gajalakshmi G, Meena S
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
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
Finite groups with prime graphs of diameter 5 [PDF]
, 2020 Gorshkov, I. B. Finite groups with prime graphs of diameter 5 / Ilya B. Gorshkov, Andrey V. Kukharev // Communications in Mathematics. – 2020. – Volume 28, № 3. – P. 307–312.
Gorshkov, I. B. +3 more
core +1 more source
Ratio Mathematica, 2023 In prime labeling, vertices are labeled from 1 to n, with the condition that any two adjacent vertices have relatively prime labels. Coprime labeling maintains the same criterion as prime labeling with adjacent vertices using any set of distinct positive
Janani R, Ramachandran T
doaj +1 more source
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
Diagonalized Cartesian products of S-prime graphs are S-prime
, 2022 S.74-80A graph is said to be S-prime if, whenever it is a subgraph of a nontrivial Cartesian product graph, it is a subgraph of one of the factors. A diagonalized Cartesian product is obtained from a Cartesian product graph by connecting two vertices of ...
Ostermeier, Lydia +2 more
core +2 more sources