Results 41 to 50 of about 1,036,687 (287)
ON PRIME LABELING OF THETA GRAPH
, 2016 A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct integers such that for each edge the labels assigned to and are relatively prime. A graph which admits prime labeling is called a prime graph.
Dr. K. Balamurugan, V. Ganesan
core +1 more source
Graph coloring using commuting order product prime graph [PDF]
, 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.
Bello, Muhammed +5 more
core +1 more source
Prime and Odd Prime Labelings on Cycle-Related Graphs
Science and Technology IndonesiaGraph labeling is the process of determining integer values for vertices, edges, or both, based on certain criteria. Let G be a simple graph with the finite vertex set V(G). Prime labeling of G is a bijection ⍺:V(G)→{1,2,…,|V(G)|} for which each pair of
Hafif Komarullah +3 more
doaj +1 more source
Recognition of prime graphs from a prime subgraph
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierre Ille, Roger Villemaire
openaire +4 more sources
ON PRIME LABELING OF HERSCHEL GRAPH
, 2016 A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct integers such that for each the labels assigned to and are relatively prime.
Dr. K. Balamurugan, V. Ganesan
core +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 ideal sum graph of a commutative ring
, 2022 WOS:000849400100002Let R be a commutative ring with identity. The prime ideal sum graph of R, denoted by PIS(R), is a graph whose vertices are nonzero proper ideals of R and two distinct vertices I and J are adjacent if and only if I + J is a prime ideal
Çelikel, Ece Yetkin +7 more
core +1 more source
Determination of the prime bound of a graph
Contributions to Discrete Mathematics, 2014 Given a graph G, a subset M of V(G) is a module of G if for each v∈V(G)∖M, v is adjacent to all the elements of M or adjacent to none of them. For instance, V(G), ∅ and {v} (v∈V(G)) are modules of G called trivial. Given a graph G, ωM(G) (respectively αM(G)) denotes the largest integer m such that there is a module M of G which is a clique ...
Ille, Pierre, Boussaïri, Abderrahim
openaire +4 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
PRIME LABELING IN DUPLICATE GRAPH OF SOME GRAPHS
, 2019 <p>A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding such that the labels of each pair of adjacent vertices are relatively prime.
P. Kavitha*1 & A. Rajasekaran2
core +1 more source