Results 61 to 70 of about 1,343 (197)
Lexicographic product of extendable graphs [PDF]
, 2010 Lexicographic product G ? H of two graphs G and H has vertex set V(G) X V(H) and two vertices (u1,v1) and (u2,v2) are adjacent whenever u1u2 ? E(G), or u1 = u2 and v1v2 ? E(H).
Husna Zayadi
core
Broadcast domination of lexicographic and modular products of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A dominating broadcast labeling of a graph G is a function [Formula: see text] such that [Formula: see text] for all [Formula: see text] where e(v) is the eccentricity of v, and for every vertex [Formula: see text] there exists a vertex v with [Formula ...
Jishnu Sen, Srinivasa Rao Kola
doaj +1 more source
Lexical Syllabus in Elementary and Secondary Education: Construction and Implementation
TESOL Quarterly, EarlyView.Abstract Nonnative language users operate with significantly limited vocabularies compared to native speakers, particularly when the language is learnt in school contexts. This paper demonstrates how empirical research on vocabulary learning combined with experience in teaching and curricula design has informed the principled construction of a lexical ...
Batia Laufer
wiley +1 more source
The core of a vertex transitive complementary prism of a lexicographic product [PDF]
, 2023 The complementary prism of a graph $Gamma$ is the graph $Gamma overline{Gamma}$, which is formed from the union of $Gamma$ and its complement $overline{Gamma}$ by adding an edge between each pair of identical vertices in $Gamma$ and $overline{Gamma ...
Marko Orel, Orel, Marko
core +2 more sources
On the Packing Partitioning Problem on Directed Graphs
Mathematics, 2021 This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source
History, EarlyView.Abstract Participants in Russia's 1825 Decembrist uprising against the Tsarist regime were, quite literally, a case study in French cultural influence upon Russia. This is particularly true as it relates to Russia's emotional cultures. Although this has not, traditionally, been the primary focus of historical analysis of this event (in Soviet or ...
ADAM COKER
wiley +1 more source
Tewdwr: Eponymous Ancestor of the Tudor Dynasty
History, EarlyView.Abstract The standard derivation of the dynastic name Tudor from Welsh Tudur, surname of the grandfather of Henry VII, is problematic on phonological grounds, as well as the fact that Tudur was never used as a surname by Henry himself, being attributed to him only by his enemies with implication of lowly origins.
DAFYDD JOHNSTON
wiley +1 more source
Five Principles for a New Economic Consensus
Global Policy, EarlyView.ABSTRACT This paper puts forward five principles for a new economic consensus, which could serve as a modern alternative to the Washington Consensus of 35 years ago. They are built on new ideas that have gained currency in economics over the past three decades. We also provide examples of the policies that could follow from these principles.
Timothy Besley, Andrés Velasco
wiley +1 more source
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
Discussiones Mathematicae Graph Theory, 2016 The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source