Results 101 to 110 of about 2,960,476 (260)
Semi-strong split domination in graphs [PDF]
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
A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
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]
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
Wiley‐Interscience Series in Discrete Mathematics and Optimization
S. Janson, Tomasz Łuczak, A. Rucinski
semanticscholar +5 more sources
Handwritten slides on a tabletPC in a discrete mathematics course [PDF]
Evan Golub
openalex +1 more source
Towards an intelligent online textbook for discrete mathematics [PDF]
William Billingsley, Piers Robinson
openalex +1 more source
Discrete mathematics, discrete physics and numerical methods
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