Results 101 to 110 of about 2,960,476 (260)

Semi-strong split domination in graphs [PDF]

open access: yesTransactions on Combinatorics, 2014
Given a graph $G = (V,E)$, a dominating set $D subseteq V$ is called a semi-strong split dominating set of $G$ if $|V setminus D| geq 1$ and the maximum degree of the subgraph induced by $V setminus D$ is 1.
Anwar Alwardi   +3 more
doaj  

Discrete mathematics using a computer [PDF]

open access: green, 2000
J. M. O’Donnell   +2 more
openalex   +1 more source

A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f1-heavy, if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K)
Wideł Wojciech
doaj   +1 more source

A supersymmetric AKNS problem and its Darboux-Bäcklund transformations and discrete systems [PDF]

open access: yesStudies in Applied Mathematics 135 (2015) 35-62, 2015
In this paper, we consider a supersymmetric AKNS spectral problem. Two elementary and a binary Darboux transformations are constructed. By means of reductions, Darboux and B\"acklund transformations are given for the supersymmetric modified Korteweg-de Vries, sinh-Gordon and nonlinear Schr\"odinger equations.
arxiv  

Number Theory and Discrete Mathematics [PDF]

open access: green, 2002
Ashok Agarwal   +5 more
openalex   +1 more source

Discrete mathematics, discrete physics and numerical methods

open access: yesLe Matematiche, 2007
Discrete mathematics has been neglected for a long time. It has been put in the shade by the striking success of continuous mathematics in the last two centuries, mainly because continuous models in physics proved very reliable, but also because of the greater difficulty in dealing with it.
IAVERNARO, Felice, TRIGIANTE D.
openaire   +2 more sources

Home - About - Disclaimer - Privacy