Results 21 to 30 of about 1,529,529 (310)
Prime power and prime product distance graphs [PDF]
Discrete Applied Mathematics, 2019 A graph $G$ is a $k$-prime product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the product of at most $k$ primes. A graph has prime product number $ppn(G)=k$ if it is a $k$-prime product graph but not a $(k-1)$-prime product graph.
Kaneda, Yumi +3 more
openaire +3 more sources
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
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
Computing Topological Descriptors of Prime Ideal Sum Graphs of Commutative Rings
Symmetry, 2023 Let n≥1 be a fixed integer. The main objective of this paper is to compute some topological indices and coindices that are related to the graph complement of the prime ideal sum (PIS) graph of Zn, where n=pα,p2q,p2q2,pqr,p3q,p2qr, and pqrs for the ...
E. Sözen +3 more
semanticscholar +1 more source
Even-Odd Prime Harmonious Graphs [PDF]
Pandian Journal of Mathematical Sciences, 2022 The paper considers finite and undirected simple connected graphs. Usually, graph labeling is an assignment of integers to the vertices or edges in the method.
Dr R. S. Ramkumar
doaj
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
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
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
A study on the number of edges of some families of graphs and generalized Mersenne numbers
Ratio 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
A comprehensive survey on prime graphs
Journal of Physics: Conference Series, 2020 This article presents a short and concise survey on prime graphs. The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications like “coding theory, x - ray ...
A. Parthiban, Rameshwar Dayal
semanticscholar +1 more source