Results 71 to 80 of about 5,793,190 (230)
Transactions of the Philological Society, EarlyView.Abstract Based on an analysis of the Old Literary Tibetan corpus—a corpus of the oldest documented Tibetic language—the present study provides evidence that literary Tibetan v3 verb stems (commonly termed ‘future’) initially encoded passive voice. New arguments put forward in this article range from Trans‐Himalayan nominal morphology to early Tibetan ...
Joanna Bialek
wiley +1 more source
Dominating sequences in grid-like and toroidal graphs [PDF]
, 2016 A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of $S$ is the Grundy domination number of $G$
Brešar, Boštjan +7 more
core +1 more source
Inverse Doubly Connected Domination in the Lexicographic Product of Two Graphs
International Journal For Multidisciplinary ResearchLet G be a nontrivial connected graph. A dominating set D⊆V(G) is called a doubly connected dominating set of G if both 〈D〉 and 〈V(G)\D〉 are connected. Let D be a minimum connected dominating set of G. If S⊆V(G)\D is a connected dominating set of G, then
Khaty M. Cruz +4 more
semanticscholar +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
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
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
Lexicographic Effect Algebras [PDF]
, 2014 In the paper we investigate a class of effect algebras which can be represented in the form of the lexicographic product $\Gamma(H\lex G,(u,0))$, where $(H,u)$ is an Abelian unital po-group and $G$ is an Abelian directed po-group.
Dvurečenskij, Anatolij
core
Lexicographic cones and the ordered projective tensor product
, 2018 We introduce lexicographic cones, a method of assigning an ordered vector space $\Lex(S)$ to a poset $S$, generalising the standard lexicographic cone.
A. L. Peressini +8 more
core +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
A Lexicographic Product Cancellation Property for Digraphs [PDF]
, 2012 There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographic. Of these four product graphs, the lexicographic product graph is the least studied.
Manion, Kendall
core +1 more source