Results 61 to 70 of about 1,934,842 (247)
EDGE MAGIC TOTAL LABELING PADA GRAPH -CYCLE BOOKS UNTUK [PDF]
, 2019 Edge magic total labeling pada graph adalah suatu fungsi bijektif { }; dengan | | | | sehingga berlaku Bilangan disebut magic constant. Graph mempunyai super edge magic total labeling bila label vertex adalah { }.
GULTOM, ROULI TUA +2 more
core +5 more sources
Prediction‐Guided Two‐Step Solid‐State Exploration of Unknown Pseudo‐Ternary Oxides
Advanced Intelligent Discovery, EarlyView.Prediction‐guided selection combined with two‐step solid‐state exploration enables efficient search of unknown pseudo‐ternary oxides. Broad robotic slurry screening followed by manual single‐phase isolation leads to the discovery of a new oxide, Ba5SnV6O22, showing how data‐guided experiments connect unexplored composition regions to new materials ...
Hiroyuki Hayashi
wiley +1 more source
Results of MAGIC galactic sources
, 2008 MAGIC is a single‐dish Cherenkov telescope located on La Palma (Spain), hence with an optimal view on the Northern sky. Sensitive in the 30 GeV—30 TeV energy band, it is nowadays the only ground‐based instrument being able to measure high‐energy γ‐rays ...
MAGIC COLLABORATION +2 more
core +1 more source
Local inclusive distance antimagic coloring of graphs
Indonesian Journal of CombinatoricsFor a simple graph G, a bijection f : V(G) → [1,|V (G)|] is called as a local inclusive distance antimagic (LIDA) labeling of G if w(u) ≠ w(v) for every two adjacent vertices u,v ∈ V(G) with w(u) = ∑x∈N [u] f(x).
Fawwaz Fakhrurrozi Hadiputra +4 more
doaj +1 more source
On local distance antimagic labeling of graphs
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a graph of order n and let [Formula: see text] be a bijection. For every vertex [Formula: see text], we define the weight of the vertex v as [Formula: see text] where N(v) is the open neighborhood of the vertex v. The bijection
Adarsh Kumar Handa +2 more
doaj +1 more source
Distance magic labelings of graphs [PDF]
, 2013 Razdaljno magično označevanje grafa je bijekcija f : V -> {1, 2,...,n}, z lastnostjo, da obstaja taka konstanta k, da za vsako vozlišče x grafa velja, f(x_1)+f(x_2)+...+f(x_j)= k, kjer je y_i (i = 1,...,j) iz odprte okolice vozlišča x.
Švaljek, Nika
core
Children &Society, EarlyView., 2023 Abstract As a primary source for the early ages, picture books guide preschool children's gender perception through stories and illustrations. However, previous studies have criticised an overall gender inequality in children's picture books. Compared to the increasing attention on gender diversity in the UK picture book industry, there has been little
Yi Li, Melissa Terras, Yongning Li
wiley +1 more source
Examples of distance magic labelings of the $6$-dimensional hypercube
, 2021 A distance magic labeling of an $n$-dimensional hypercube is a labeling of its vertices by natural numbers from $\{0, \ldots, 2^n-1\}$, such that for all vertices $v$ the sum of the labels of the neighbors of $v$ is the same. Such a labeling is called neighbor-balanced, if, moreover, for each vertex $v$ and an index $i=0,\ldots,n-1$, exactly half of ...
openaire +2 more sources
, 1985 Mode of access: Internet.Reprint. Orginally published weekly: Philadelphia : Benerman & Wilson. Vol. 1, no. 1 (Sept. 1874)-v. 1, no. 8 (Apr. 1875) issued as Vol. 7, no.
Magic Lantern Society of the United States and Canada.
core
The distance magic property and two families of Cartesian product graphs
Electronic Journal of Graph Theory and ApplicationsLet G = G(V, E) be a simple graph. The graph G is said to be distance magic if there exists a bijection f : V → {1, 2, …, |V|} and a constant s such that Σy ∈ N(x)f(y)=s for all x ∈ V.
Patrick Thomas Headley
doaj +1 more source