Results 41 to 50 of about 302 (172)
Dietary Advice in Dental Practice for Young Adolescents to Prevent Dental Caries: A Scoping Review
International Journal of Paediatric Dentistry, EarlyView.ABSTRACT Introduction A scoping review of dietary advice for caries prevention in adolescents in high income English‐speaking countries was conducted. Objective To identify and appraise dietary advice for dental settings in government or private sector. Method Dentistry and Oral Sciences database was searched from 2015 to September 2023.
Kodikara Arachchige Mihiri Madhuka Gunasinghe +3 more
wiley +1 more source
PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS
BarekengLet be a graph with vertices and edges. Define and . Consider a mapping by assigning different labels in to the different elements of when is even and different labels in to elements of V and repeating a label for the remaining one ...
R Ponraj, S Prabhu
doaj +1 more source
Sociology Lens, EarlyView.ABSTRACT Despite their very diverse interests, the classical sociological thinkers were concerned with analyzing the dramatic social transformations in the wake of colonialism, slavery, and modern industrial capitalism as well as the multiple revolutions, particularly in relation to the new forms of social inequalities and power disparities.
Zaheer Baber
wiley +1 more source
C-Cordial Labeling in Signed Graphs
Electronic Notes in Discrete Mathematics, 2017 Abstract In this paper, we initiate the study on C-cordial labeling in signed graphs and characterize paths and cycles with given number of negative sections and stars which admit C-cordial labeling.
openaire +2 more sources
Mean Cordial Labeling of Graphs
Open Journal of Discrete Mathematics, 2012 Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and edges respectively labelled with x ( ). A graph with a mean cordial labeling is called a mean cor- dial graph.
Raja Ponraj +2 more
openaire +2 more sources
The Enemy Who Never Went Away: Memory, Nationalism and China's Japan Policy During the Cold War
Nations and Nationalism, EarlyView.ABSTRACT This study reassesses the relationship between war memory, nationalism and Sino–Japanese relations during the Cold War. Contrary to the dominant view in existing scholarship that China's nationalist remembering of the war emerged during the 1980s and 1990s, this article, drawing on an extensive survey of the People's Daily, demonstrates that ...
Yi Wang
wiley +1 more source
Product-cordial index and friendly index of regular graphs [PDF]
Transactions on Combinatorics, 2012 Let $G=(V,E)$ be a connected simple graph. A labeling $f:V to Z_2$ induces two edge labelings $f^+, f^*: E to Z_2$ defined by $f^+(xy) = f(x)+f(y)$ and $f^*(xy) = f(x)f(y)$ for each $xy in E$. For $i in Z_2$, let $v_f(i) = |f^{-1}(i)|$, $e_{f^+}(i) = |(f^
Wai Chee Shiu, Kwong Harris
doaj
Ten rules for robust taxonomy in ecological datasets
New Phytologist, EarlyView.A workflow for better use and integration of taxonomic‐related information into ecological datasets. Summary Accurate taxonomy, including species identification and naming, underpins ecological inference, yet taxonomic information in ecological datasets is often inconsistently recorded or weakly standardized.
Renato A. Ferreira de Lima +18 more
wiley +1 more source
Some New Results on Prime Cordial Labeling [PDF]
ISRN Combinatorics, 2014 A prime cordial labeling of a graph G with the vertex set V(G) is a bijection f:V(G)→{1,2,3,…,|V(G)|} such that each edge uv is assigned the label 1 if gcd(f(u),f(v))=1 and 0 if gcd(f(u),f(v))>1; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called
Vaidya, S. K., Shah, N. H.
openaire +2 more sources
On total edge product cordial labeling of fullerenes
Electronic Journal of Graph Theory and Applications, 2018 For a simple graph G = (V, E) 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 ...
Martin Baca +3 more
doaj +1 more source