Results 51 to 60 of about 44,462 (291)
Misperception of Body Weight After Childhood Cancer
ABSTRACT Background Misperception of body weight can negatively impact the weight management efforts of childhood cancer survivors (CCSs). Both being overweight or underweight are associated with chronic health conditions commonly observed in CCS; therefore, accurate weight perception is critical for reducing long‐term health risks.
Fabiën N. Belle +8 more
wiley +1 more source
Fractional (P,Q)-Total List Colorings of Graphs
Let r, s ∈ N, r ≥ s, and P and Q be two additive and hereditary graph properties. A (P,Q)-total (r, s)-coloring of a graph G = (V,E) is a coloring of the vertices and edges of G by s-element subsets of Zr such that for each color i, 0 ≤ i ≤ r − 1, the ...
Kemnitz Arnfried +2 more
doaj +1 more source
Super local edge anti-magic total coloring of paths and its derivation
Suppose G(V,E) be a connected simple graph and suppose u,v,x be vertices of graph G. A bijection f : V ∪ E → {1,2,3,...,|V (G)| + |E(G)|} is called super local edge antimagic total labeling if for any adjacent edges uv and vx, w(uv) 6= w(vx), which w(uv)
Fawwaz Fakhrurrozi Hadiputra +2 more
doaj +1 more source
Some results on the total proper k-connection number
In this paper, we first investigate the total proper connection number of a graph GG according to some constraints of G¯\overline{G}. Next, we investigate the total proper connection numbers of graph GG with large clique number ω(G)=n−s\omega \left(G)=n ...
Ma Yingbin, Zhang Hui
doaj +1 more source
ABSTRACT The International Paediatric Oncology Society Global Mapping Programme aims to collect data on global paediatric oncology services by continent, with Africa and Latin America completed. This study reports on the methodology and lessons learned for Oceania, a unique continent with resource disparity across countries, multiple small island ...
Trisha Soosay Raj +16 more
wiley +1 more source
Total Coloring of Some Classes of Cayley Graphs on Non-Abelian Groups [PDF]
Total Coloring of a graph G is a type of graph coloring in which any two adjacent vertices, an edge, and its incident vertices or any two adjacent edges do not receive the same color.
Jayabalan Geetha +3 more
core +1 more source
A proof of the Total Coloring Conjecture
No major changes in this third-version apart from addition of Remark 3.5, corrections of typos, and some minor refinements in explanation as and where it was ...
openaire +2 more sources
ABSTRACT Background Although significant progress has been made in childhood leukemia survival, healthcare providers, and caregivers often face challenges in explaining this disease to patients. Disease‐targeted storybooks have been proposed as a tool to facilitate the understanding of diagnoses and treatment.
Nutvipha Ummartyotin +6 more
wiley +1 more source
On adjacent vertex distinguishing total coloring of quadrilateral snake [PDF]
In this paper, we prove the existence of the adjacent vertex distinguishing total coloringnof quadrilateral snake, double quadrilateral snake, alternate quadrilateral snake and double alternate quadrilateral snake in detail. Also, we present an algorithm
Thirusangu, K, Ezhilarasi, R
core +2 more sources
Total coloring conjecture on certain classes of product graphs
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no adjacent vertices and edges receive the same color.
Kanagasabapathi Somasundaram +2 more
doaj +1 more source

