Results 91 to 100 of about 1,144,592 (210)
E-cordial Labeling for Cartesian Product of Some Graphs [PDF]
, 2011 We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 andK1,n × P2 are E-cordial for n odd.
Vaidya, S. K., Vyas, N. B.
core +1 more source
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
MathematicsThe security of traditional public key cryptography algorithms depends on the difficulty of the underlying mathematical problems. Asymmetric topological encryption is a graph-dependent encryption algorithm produced to resist attacks by quantum computers ...
Jing Su, Bing Yao
doaj +1 more source
Pelabelan Graceful Sisi-ganjil Pada Graf Web W(2,n) [PDF]
, 2014 Let G = (V(G),E()) be a graph with vertex set () and edge set (). Assume that graph G have edge. Graceful edge-odd labeling is a bijective map ∶ () → {1, 3, 5,…,2 – 1} that resulting map + : () → {0,1,2,…,2 −1} with
Ratnasari, L. (Lucia) +2 more
core
Edge Odd Graceful Labeling of Some Ladder and Path Related Graphs
An edge odd graceful labeling of graph G with p vertices and q edges is a modular technique of edge labeling, introduced bySolairaju and Chithra in 2008 [9]. It is a bijection f from the edge set E(G) of the graph to {1, 3,…, 2q - 1} such that, when each
K Kanani Kailas, K Valani Darshana
core +1 more source
A Metaheuristic Approach to the Graceful Labeling Problem
, 2010 In graph theory, a graceful labeling of a graph G = (V, E) with n vertices and m edges is a labeling of its vertices with distinct integers between 0 and m inclusive, such that each edge is uniquely identified by the absolute difference between its ...
Houra Mahmoudzadeh, Kourosh Eshghi
core +1 more source
The Anatomical Record, EarlyView.This review redefines the carotid bulb (CB) as a variable geometric dilation shaped by hemodynamics and the carotid sinus (CS) as a conserved neurohistological baroreceptor field. Distinguishing these entities clarifies a century of anatomical confusion and links geometry, neurohistology, and clinical interpretation within a unified framework ...
Răzvan Costin Tudose +2 more
wiley +1 more source
Graceful Labeling on Grids in 3-Dimensions and 4-Dimensions
, 2007 優美標號(Graceful labeling)最早是由Rosa在1966年提出。一個graph G上的端點標號(vertex labeling)所指的是一個vertex的函數f對應到一些數值(即標號)，而G上的每一edge xy 被指定一個由f(x)和f(y)所決定的數值。如果這樣的一個f:V-->{0,1,...|E|}是單射，且指定 edge xy 的數值為|f(x)-f(y)|而所有的edge都被指定不同的數值，則f被稱為一個優美標號。 Rosa提出假說猜測所有的tree都有優美標號 ...
Chen, Yi-xian, 陳奕先
core
Applications of mathematical programming in graceful labeling of graphs [PDF]
, 2004 Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper,
Parham Azimi, Kourosh Eshghi
core +1 more source
Animal Research and One Health, EarlyView.vvrr1, a small RNA, post‐transcriptionally represses the transcriptional regulator LeuO, which directly inhibits the VarS/VarA two‐component system. This triggers a Csr cascade that relieves LuxO repression, ultimately modulating exopolysaccharide production to control biofilm formation and virulence in Vibrio alginolyticus.
Theerakamol Pengsakul +6 more
wiley +1 more source
British Educational Research Journal, EarlyView.Abstract Character education research is often constrained by blunt methodological tools. Surveys capture breadth without depth; case studies offer richness but lack replicability; and randomised controlled trials (RCTs), though indispensable at the policy level, are costly, disruptive and ill‐suited to everyday practice with individual pupils.
Shane McLoughlin
wiley +1 more source