Results 151 to 160 of about 264,040 (183)

Split domination number of divisible dominating graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2020
A graph G is a divisible dominating graph if the vertices are labeled with positive integers d and n except 0, such that the vertex labeled with n is adjacent to the vertex named with d if and only...
S. Amutha, K. Suriya Prabha, N. Anbazhagan, P. Shanthi   +3 more
openaire   +1 more source

Vector Domination in split-indifference graphs

Information Processing Letters, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo Lamblet Mafort, Fábio Protti
openaire   +1 more source

Conditions for dominated splittings

Acta Mathematica Sinica, English Series, 2009
Let \(M\) be an \(m\)-dimensional closed manifold (\(m\geq 2\)) and \(\text{Diff}^1(M)\) be the space of diffeomorphisms of \(M\) endowed with the \(C^1\) topology. For \(f\in\text{Diff}^1(M)\), let \(\Lambda\) be its compact invariant set. A \(Df\)-invariant splitting \(T_{\Lambda}M=E\oplus F\) is called a dominated splitting of index \(i\) over ...
Liu, Geng, Liang, Chao
openaire   +1 more source

THE DOMINATION GAME ON SPLIT GRAPHS

Bulletin of the Australian Mathematical Society, 2018
We investigate the domination game and the game domination number $\unicode[STIX]{x1D6FE}_{g}$ in the class of split graphs. We prove that $\unicode[STIX]{x1D6FE}_{g}(G)\leq n/2$ for any isolate-free $n$-vertex split graph $G$, thus strengthening the conjectured $3n/5$ general bound and supporting Rall’s $\lceil n/2\rceil$-conjecture.
TIJO JAMES, SANDI KLAVŽAR, AMBAT VIJAYAKUMAR   +2 more
openaire   +1 more source

Pinball billiards with dominated splitting

Ergodic Theory and Dynamical Systems, 2009
AbstractWe study the dynamics of a type of non-conservative billiards where the ball is ‘kicked’ by the wall giving a new impulse in the direction of the normal. For different types of billiard tables we study the existence of attractors with dominated splitting.
Markarian, Roberto, Pujals, Enrique J., Sambarino, Martín   +2 more
openaire   +2 more sources

Dominated splitting versus small angles

Acta Mathematica Sinica, English Series, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Chao, Liu, Geng
openaire   +1 more source

Independent Domination of Splitted Graphs

International Journal of Mathematics Trends and Technology, 2014
A dominating set D of a splitted graph S(G) = ( V, E ) is an independent dominating set if the induced subgraph has no edges. The independent domination number i[S(G)] of a graph S(G) is the minimum cardinality of an independent dominating set.
A.Nellai Murugan, A.Esakki muthu
openaire   +1 more source

Detour global domination for splitting graph

Discrete Mathematics, Algorithms and Applications, 2022
In this paper, we introduced the new concept detour global domination number for splitting graph of standard graph. The detour global dominating sets in some standard and special graphs are determined. First we recollect the concept of splitting graph of a graph and we produce some results based on the detour global domination number of splitting ...
Jayasekaran, C., Ashwin Prakash, S. V.
openaire   +1 more source

TOTAL DOMINATION POLYNOMIALS OF SOME SPLITTING GRAPHS

Advances and Applications in Discrete Mathematics, 2017
Summary: A hypergraph is an ordered pair \(H=(V,E)\), where \(V\) is a finite nonempty set called vertices and \(E\) is a collection of subsets of \(V\), called hyperedges or simply edges. A subset \(T\) of vertices in a hypergraph \(H\) is called a vertex cover if \(T\) has a nonempty intersection with every edge of \(H\). The vertex covering number \(
Latheeshkumar, A. R., Kumar, V. Anil
openaire   +2 more sources

Homoclinic tangencies and dominated splittings

Nonlinearity, 2002
Summary: We characterize diffeomorphisms that are \(C^1\) away from homoclinic tangencies by using dominated splittings on the \(C^1\) preperiodic sets. More precisely, we prove that a diffeomorphism \(f\) cannot be \(C^1\) approximated by systems with homoclinic tangencies if and only if for all \(1\leq i\leq d-1\), the \(C^1\) \(i\)-preperiodic set \(
openaire   +2 more sources