Results 11 to 20 of about 30,352 (163)
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
ON FINITE PRIME DISTANCE GRAPHS
Indian Journal of Pure and Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parthiban, A. +2 more
openaire +2 more sources
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
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
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
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
Mathematics of Computation, 1979 Let p n {p_n} denote the nth prime. The prime number graph is the set of lattice points ( n , p n ) (n,{p_n}) , n = 1 , 2 , … n = 1,2 ...
openaire +1 more source