Results 61 to 70 of about 312,012 (172)
Strong chromatic index of sparse graphs [PDF]
, 2013 A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $\chi_{s}^{\prime}(G)$, is the least number of colors in a strong edge coloring of $G$.
Dębski, Michał +2 more
core
Complement of the generalized total graph of fields
AKCE International Journal of Graphs and Combinatorics, 2020 Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
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
Relative Prime Coprime Graph of Integers Modulo Group and Its Reverse Topological Indices
Pan-American Journal of MathematicsThe relationship between edges and vertices is fundamental to graph theory, significantly influencing different graph properties and applications.
Abdurahim - +3 more
doaj +1 more source
Graph coloring using commuting order product prime graph
Journal of Mathematics and Computer Science, 2020 The concept of graph coloring has become a very active field of research that enhances many practical applications and theoretical challenges. Various methods have been applied in carrying out this study. Let G be a finite group. In this paper, we introduce a new graph of groups, which is a commuting order product prime graph of finite groups as a ...
Bello, Muhammed +2 more
openaire +3 more sources
Extending Undirected Graph Techniques to Directed Graphs via Category Theory
MathematicsWe use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra +4 more
doaj +1 more source
Prime labelings on a 3xn grid graph
Theory and Applications of GraphsIt is conjectured that the mxn grid graph has a prime labeling for all positive integers m and n. It is known that for any prime p and any integer n such that 1≤n≤p2, there exists a prime labeling on the pxn grid graph Pm x Pn. Also, it is known that the
Stephen J. Curran, Matt A. Ollis
doaj +1 more source
Mathematics, 2019 In this paper, we investigate the graph structures on hoop algebras. First, by using the quasi-filters and r-prime (one-prime) filters, we construct an implicative graph and show that it is connected and under which conditions it is a star or tree.
Mona Aaly Kologani +2 more
doaj +1 more source
Prime vertex-minors of a prime graph
European Journal of Combinatorics33 pages, 11 figures.
Kim, Donggyu, Oum, Sang-il
openaire +2 more sources
Characterization of rings with planar, toroidal or projective planar prime ideal sum graphs
AKCE International Journal of Graphs and CombinatoricsLet R be a commutative ring with unity. The prime ideal sum graph [Formula: see text] of the ring R is the simple undirected graph whose vertex set is the set of all nonzero proper ideals of R and two distinct vertices I and J are adjacent if and only if
Praveen Mathil +3 more
doaj +1 more source