Results 51 to 60 of about 2,130,896 (179)
Integer-Magic Spectra of Sun Graphs
, 2013 國科會研究計畫：NSC 98-2115-M-032-005-MY3Let N be the set of all positive integers, and Zn={0, 1, 2, …, n-1}. For any h ∈ N, a graph G=(V,E) is said to be Zh-magic if there exists a labeling f : E → Zh\{0} such that induced vertex labeling f+ : V → Zh, defined ...
Fu, Chin-Mei; Jhuang, Nan-Hua; Lin, Yuan-Lung
core +1 more source
On magic joins of graphs [PDF]
, 2010 summary:A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Ivančo, Jaroslav +4 more
core +1 more source
Journal of Management Studies, EarlyView.Abstract This essay argues that social media document (rather than fuel) the decline of political democracy while helping revive organizational democracy, including through ‘decentralized autonomous organizations’ (DAOs). Yet, despite giving everyone a voice and the ability to organize across borders, social media could over‐concentrate power if, in ...
J.P. Vergne
wiley +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
New Phytologist, EarlyView.The MexMAGIC population mixes native maize varieties from across Mexico to study functional genetic diversity. Summary Defining the genetic basis of local adaptation is a key goal of evolutionary biology and crop improvement. Theory predicts that when selective pressures follow differences in the environment, a cline will be established.
Sergio Perez‐Limón +18 more
wiley +1 more source
On Almost Distance-Regular Graphs [PDF]
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Fiol, M.A. +4 more
core +2 more sources
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
Plant Biotechnology Journal, EarlyView.ABSTRACT Fruit cuticles regulate the diffusion of water, gases and solutes, functioning as essential protective interfaces against environmental and biotic stresses. Engineering cuticle structure and mechanics therefore represents a promising strategy for improving fruit quality and resilience.
Gulab Chand Arya +5 more
wiley +1 more source
Topics in Cognitive Science, EarlyView.Abstract The space of human goals is tremendously vast; and yet, from just a few moments of watching a scene or reading a story, we seem to spontaneously infer a range of plausible motivations for the people and characters involved. What explains this remarkable capacity for intuiting other agents' goals, despite the infinitude of ends they might ...
Tan Zhi‐Xuan +3 more
wiley +1 more source
On Structural and Spectral Properties of Distance Magic Graphs
, 2023 A graph $G=(V,E)$ is said to be distance magic if there is a bijection $f$ from a vertex set of $G$ to the first $|V(G)|$ natural numbers such that for each vertex $v$, its weight given by $\sum_{u \in N(v)}f(u)$ is constant, where $N(v)$ is an open neighborhood of a vertex $v$. In this paper, we introduce the concept of $p$-distance magic labeling and
Mukherjee, Himadri +2 more
openaire +2 more sources