Results 21 to 30 of about 374,945 (254)
Matching-Type Image-Labelings of Trees
, 2021 A variety of labelings on trees have emerged in order to attack the Graceful Tree Conjecture, but lack showing the connections between two labelings. In this paper, we propose two new labelings: vertex image-labeling and edge image-labeling, and combine ...
Hongyu Wang, Bing Yao, Jing Su
core +1 more source
Circulation in Computer Science, 2017 We show that some special families of graphs have prime cordial labeling. We prove that If G is not a prime cordial graph of order m then G∪K_(1,n)is a prime cordial graph if E(G)= n-1,n or n+1 , and we prove that S^' (K_(2,n)), Jelly fish graph , Jewel graph, the graph obtained by duplicating a vertex v_k in the rim of the helm H_nand the graph ...
M. A. Seoud +2 more
openaire +1 more source
One Curious Identity Counting Graceful Labelings
, 2021 Let $a$ and $b$ be positive integers with prime factorisations $a = p_1^np_2^n$ and $b = q_1^nq_2^n$. We prove that the number of essentially distinct $\alpha$-graceful labelings of the complete bipartite graph $K_{a, b}$ equals the alternating sum of ...
Beluhov, Nikolai
core +1 more source
Certain Results on Prime and Prime Distance Labeling of Graphs
Journal of Physics: Conference Series, 2020 Abstract Let G be a graph on n vertices. A bijective function f : V (G) → {1, 2,…,n} is said to be a prime labeling if for every e = xy, GCD{f (x),f (y)} = 1. A graph which permits a prime labeling is a “prime graph”. On the other hand, a graph G is a prime distance graph if there is an injective function g : V(G) → Z (the set of all ...
A. Parthiban, Ajaz Ahmad Pir, A. Felix
openaire +1 more source
PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS
BarekengGraph 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 +4 more
doaj +1 more source
International Journal of Mathematics and Soft Computing, 2015 In this paper we introduce neighborhood-prime labeling and investigate neighborhoodprime labelings for paths, cycles, helm, closed helm and flower. Also we establish a sufficient condition for a graph to admit neighborhood-prime labeling.
N. N. Shrimali, S. K. Patel
openaire +1 more source
Exchanging with Prime Advantage Prime Advantage in UK
, 2021 Prime Advantage is fitting to preliminary all components of the stage utilizing demo exchanging highlights. Demo exchanging utilizes information to reproduce genuine exchanging.
Prime Advantage
core +1 more source
On a Question of Prime Labeling of Graphs
Journal of Advances in Mathematics and Computer Science, 2021 In the field of graph theory, the complete graph of vertices is a simple undirected graph such that every pair of distinct vertices is connected by a unique edge. In the present work, we introduce planar subgraph of with maximal number of edges . Generally, does not admit prime labeling. We present an algorithm to obtain prime-labeled subgraphs of
P. G. R. S. Ranasinghe +1 more
openaire +2 more sources
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
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