Results 21 to 30 of about 149,581 (278)
Anosov representations and dominated splittings [PDF]
Journal of the European Mathematical Society, 2019 We provide a link between Anosov representations introduced by Labourie and dominated splitting of linear cocycles. This allows us to obtain equivalent characterizations for Anosov representations and to recover recent results due to Guéritaud–Guichard–Kassel–Wienhard [GGKW] and Kapovich–Leeb–Porti [KLP2] by different methods.
Da Silva Bochi, Jairo +2 more
openaire +4 more sources
Algorithmic complexity of secure connected domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple, undirected, and connected graph. A connected (total) dominating set is a secure connected (total) dominating set of G, if for each there exists such that and is a connected (total) dominating set of G. The minimum cardinality of a secure
J. Pavan Kumar +2 more
doaj +1 more source
Roman {2}-Domination Problem in Graphs
Discussiones Mathematicae Graph Theory, 2022 For a graph G = (V, E), a Roman {2}-dominating function (R2DF) f : V → {0, 1, 2} has the property that for every vertex v ∈ V with f(v) = 0, either there exists a neighbor u ∈ N(v), with f(u) = 2, or at least two neighbors x, y ∈ N(v) having f(x) = f(y) =
Chen Hangdi, Lu Changhong
doaj +1 more source
Janet Halley and the Art of Status Quo Maintenance [PDF]
, 2018 Over the past few years, Janet Halley emerged as one of the most avid critics of campus rape feminist activists, activists who push for the reformulation of university investigative rules to shift the burden of proof from the accuser to the accused ...
Abu-Odeh, Lama
core +2 more sources
Dominated splitting and Pesin's entropy formula
Discrete & Continuous Dynamical Systems - A, 2012 Let $M$ be a compact manifold and $f:\,M\to M$ be a $C^1$ diffeomorphism on $M$. If $ $ is an $f$-invariant probability measure which is absolutely continuous relative to Lebesgue measure and for $ $ $a.\,\,e.\,\,x\in M,$ there is a dominated splitting $T_{orb(x)}M=E\oplus F$ on its orbit $orb(x)$, then we give an estimation through Lyapunov ...
Sun, Wenxiang, Tian, Xueting
openaire +2 more sources
Algorithmic Aspects of Some Variants of Domination in Graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj +1 more source
IEEE Access, 2020 For the split delivery vehicle routing problem in the distribution link of logistics where the optimization objective is to minimize the total distance of the transportation path, a hybrid discrete differential evolution (HDDE) algorithm is adopted in ...
Li-Ning Xing +5 more
doaj +1 more source
Informbirovska kriza i Bosna i Hercegovina (1948-1956) u historijskim izvorima i historiografiji // Informbiro crisis and Bosnia and Herzegovina (1948-1956) in historical sources and historiography [PDF]
Historijski pogledi, 2021 In terms of historiography, the history of Bosnia and Herzegovina after the Second World War has been dealt with by many historians and scholars, dealing with and researching topics related to the economy, culture, the issue of religious communities ...
JASMIN JAJČEVIĆ
doaj +1 more source
On $[1,2]$-Domination in Interval and Circle Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA subset $S$ of vertices in a graph $G=(V, E)$ is a Dominating Set if each vertex in $V(G)\setminus S$ is adjacent to at least one vertex in $S$. Chellali et al.
Mohsen Alambardar Meybodi +1 more
doaj +1 more source
Проект Байкал, 2021 The period of the “socialist project” occupied the biggest part of the 20th century. Hugescale social experiments have greatly shaped the present-day city’s appearance.
Елена Григорьева
doaj +1 more source