Results 21 to 30 of about 990,454 (252)
Prime Graph over Cartesian Product over Rings and Its Complement [PDF]
, 2023 Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc.
Vira Hari Krisnawati +5 more
core +3 more sources
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Prime Labelings of Snake Graphs
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 +4 more
openaire +2 more sources
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
Open MathematicsAbstract In the context of a simple undirected graph G G , a
Abughneim Omar A., Abughazaleh Baha’
openaire +2 more sources
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
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
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
FEBS Letters, EarlyView.Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
On the subsequence of primes having prime subscripts [PDF]
, 2009 We explore the subsequence of primes with prime subscripts, (qn), and derive its density and estimates for its counting function. We obtain bounds for the weighted gaps between elements of the subsequence and show that for every positive integer m there ...
Barnett, A. Ross, Broughan, Kevin A.
core