Results 51 to 60 of about 313,722 (173)
Prime labelings on planar grid graphs
Theory and Applications of Graphs, 2022 It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn.
Stephen James Curran
doaj +1 more source
, 2015 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi, Lorenzo
core +2 more sources
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
Coprime and prime labelings of graphs
J. Integer Seq., 2016 14 pages, this version is the one accepted by the Journal of Integer ...
Adam H. Berliner +5 more
openaire +4 more sources
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
The Second Subconstituent of some Strongly Regular Graphs [PDF]
, 2010 This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts.
Biggs, Norman
core +1 more source
Prime coprime graph of a finite group
Novi Sad Journal of Mathematics, 2021 Summary: In this paper, a new graph structure called the \textit{prime coprime graph} of a finite group \(G\) denoted by \(\Theta(G)\) has been introduced. The \textit{coprime graph} of a finite group, introduced by \textit{X. Ma} et al. [Int. J. Group Theory 3, No.
Adhikari, Avishek, Banerjee, Subarsha
openaire +2 more sources
Finite prime distance graphs and 2-odd graphs
Discrete Mathematics, 2013 A graph $G$ is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs ...
Joshua D. Laison +2 more
openaire +3 more sources
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
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