Results 11 to 20 of about 302 (172)
On the Larval Sensory Organs and Central Nervous System of the Zoea 1 of the Asian Shore Crab Hemigrapsus sanguineus (Decapoda, Brachyura). [PDF]
J Comp NeurolWe provide a description of the morphology of selected sensory organs and of the central nervous system in the Zoea 1 of the Asian shore crab Hemigrapsus sanguineus using multiple neuroanatomical methods. Our data reveal well‐developed visual and olfactory organs and complex primary sensory neuropils related to processing this input.
Harzsch S +12 more
europepmc +2 more sources
ℤ2 × ℤ2-Cordial Cycle-Free Hypergraphs
Discussiones Mathematicae Graph Theory, 2021 Hovey introduced A-cordial labelings as a generalization of cordial and harmonious labelings [7]. If A is an Abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edge labeling on G; the edge uv receives the label f(u) +
Cichacz Sylwia +2 more
doaj +1 more source
On 3-total edge product cordial labeling of a carbon nanotube network
AKCE International Journal of Graphs and Combinatorics, 2019 For a simple graph G=(V,E)with the vertex set Vand the edge set Eand for an integer k, 2≤k≤|E(G)|, an edge labeling φ:E(G)→{0,1,…,k−1}induces a vertex labeling φ∗:V(G)→{0,1,…,k−1}defined by φ∗(v)=φ(e1)⋅φ(e2)⋅…⋅φ(en)(modk), where e1,e2,…,enare the edges ...
Martin Bača +2 more
doaj +2 more sources
Neutrosophic Divisor Cordial Labeling Graphs [PDF]
Neutrosophic Sets and SystemsIn this paper we introduced a novel concept – Neutrosophic Divisor Cordial Labeling a have proved that graphs such as wheels, helms and closed helm graph satisfy this new labeling. This paper builds upon our previous work in Neutrosophic Cordial Labeling
Tephilla Joice P, A.Rajkumar
doaj +1 more source
Pell Even Sum Cordial Labeling of Graphs
Ratio Mathematica, 2023 LetG=(V,E) be a simple graph and let P_i be Pell numbers. For a bijectionf:V\left(G\right)\rightarrow{P_0,\ P_1,\ldots,P_{\left|V\right|-1}}, assign the label 1 for the edge e=uv if f\left(u\right)+f(v) is even and label 0 otherwise. Then f is said to be
Christina Mercy, T Tamizh Chelvam
doaj +1 more source
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Kuo +2 more
openaire +2 more sources
Some results on cordiality labeling of generalized Jahangir graph
Indonesian Journal of Combinatorics, 2017 In this paper we consider the cordiality of a generalized Jahangir graph $J_{n,m}$. We give sufficient condition for $J_{n,m}$ to admit (or not admit) the prime cordial labeling, product cordial labeling and total product cordial labeling.
Roslan Hasni +2 more
doaj +1 more source
Strongly*-2 Divisor Cordial Labeling of Cycle Related Graphs
Ratio Mathematica, 2023 A strongly*-2 divisor cordial labeling of a graph G with the vertex set V (G) is a bijection a : V (G) → {1, 2, 3, ..., |V (G)|} such that each edge cd assigned the label 1 if the lower integal value of sum of a(c), a(d) and a(c)a(d) divided by 2 is odd ...
C. Jayasekaran, V.G. Michael Florance
doaj +1 more source
3-total edge product cordial labeling of rhombic grid
AKCE International Journal of Graphs and Combinatorics, 2019 For a simple graph G=(V(G),E(G)), this paper deals with the existence of an edge labeling χ:E(G)→{0,1,…,k−1},2≤k≤|E(G)|, which induces a vertex labeling χ∗:V(G)→{0,1,…,k−1}in such a way that for each vertex v, assigns the label χ(e1)⋅χ(e2)⋅⋯⋅χ(en)((modk))
Aisha Javed, Muhammad Kamran Jamil
doaj +2 more sources
Ratio Mathematica, 2023 Any graph operation of a graph drive only one graph structure. But eccentric graph operation of almost all the graphs drives more than one graph structure, which are interesting and marvelous one. The eccentric graph of G is denoted by ecc(G).
K Periasamy +2 more
doaj +1 more source