Results 21 to 30 of about 782,126 (230)

Prime Labelings of Snake Graphs [PDF]

The PUMP Journal of Undergraduate Research, 2019
A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime. In this paper, we introduce a snake graph, the fused union of identical cycles, and define a consecutive snake prime labeling for this new family of graphs.
Abigail Bigham, Elizabeth Ann Donovan, James Pack, Jordan Turley, Lesley Wiglesworth   +4 more
core   +4 more sources

On Prime Index of a Graph

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   +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
exaly   +5 more sources

On prime inductive classes of graphs [PDF]

European Journal of Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ewa Drgas-Burchardt, Drgas-Burchardt, Ewa   +1 more
openaire   +2 more sources

Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime [PDF]

Discrete Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler   +2 more
core   +5 more sources

PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS

Barekeng
Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph  with a vertex-set  and an edge-set .
Desi Rahmadani, Ardi Aldiansyah, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari   +4 more
doaj   +2 more sources

Prime Graphs with Almost True Twin Vertices

Mathematics
A graph G consists of a possibly infinite set V(G) of vertices with a collection E(G) of unordered pairs of distinct vertices, called the set of edges of G. Such a graph is denoted by (V(G),E(G)).
Aymen Ben Amira, Moncef Bouaziz
doaj   +2 more sources

On prime labeling of union of tadpole graphs [PDF]

, 2022
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the first $n$ positive integers in such a way that the labels of any two adjacent vertices in $G$ are relatively prime. If such a labeling on $G$ exists then
Patel, Sanjaykumar K., Vasava, Jayesh B.
core   +1 more source

Odd Prime Labeling For Some Arrow Related Graphs

Ratio Mathematica, 2023
In a graph G a mapping g is known as odd prime labeling , if g is a bijection from V to f1; 3; 5; ::::; 2jVj - 1g satisfying the condition that for each line xy in G the gcd of the labels of end points (g(x); g(y)) is one.
Gajalakshmi G, Meena S
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