Results 41 to 50 of about 30,352 (163)
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
On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
Open Mathematics, 2022 A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article,
Ling Bo, Lan Ting, Ding Suyun
doaj +1 more source
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source
A Numerical Study on the Regularity of d-Primes via Informational Entropy and Visibility Algorithms
Complexity, 2020 Let a d-prime be a positive integer number with d divisors. From this definition, the usual prime numbers correspond to the particular case d=2. Here, the seemingly random sequence of gaps between consecutive d-primes is numerically investigated.
B. L. Mayer, L. H. A. Monteiro
doaj +1 more source
A construction of small regular bipartite graphs of girth 8 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let q be a prime a power and k an integer such that 3 ≤ k ≤ q. In this paper we present a method using Latin squares to construct adjacency matrices of k-regular bipartite graphs of girth 8 on 2(kq2 -- q) vertices.
Camino Balbuena
doaj +1 more source
, 2017 Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that if each edge is assigned the label when gcd and otherwise, then the difference between the number of edges labeled with and the number of edges labeled with is at most . A graph which admits prime cordial labeling is called a prime cordial graph. In
M. Bhuvaneshwari +2 more
openaire +1 more source
PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS
BarekengGraph 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 +4 more
doaj +1 more source
Pelabelan Prima pada Kelas Graf Hasil Operasi Perkalian Tensor
Jambura Journal of MathematicsA graph with a vertex set is said to be a prime graph if there exists a bijective mapping , where denotes the number of vertices in , such that for any two adjacent vertices and in have . Tensor Product graph is a way to combine (compose)
Suci Triwahyuniti, Desi Rahmadani
doaj +1 more source
Prime Factorization And Domination In The Hierarchical Product Of Graphs
Discussiones Mathematicae Graph Theory, 2017 In 2009, Barrière, Dalfó, Fiol, and Mitjana introduced the generalized hierarchical product of graphs. This operation is a generalization of the Cartesian product of graphs.
Anderson S.E. +3 more
doaj +1 more source
Effective Conversion of Non-Prime Graphs to Prime Graphs
International Journal of Analysis and ApplicationsA graph G is considered to have a prime labeling when each of its n vertices is assigned a unique label from the set {1, 2, 3, 4, ..., n}, ensuring that the labels of any two connected vertices are coprime. In the literature, many graph classes identified as prime graphs and non-prime graphs.
Karnam Gurunadhan Tharunraj +1 more
openaire +1 more source