Results 21 to 30 of about 3,348,536 (356)
Local irregularity conjecture for 2-multigraphs versus cacti [PDF]
A multigraph is locally irregular if the degrees of the end-vertices of every multiedge are distinct. The locally irregular coloring is an edge coloring of a multigraph \(G\) such that every color induces a locally irregular submultigraph of \(G\).
Igor Grzelec, Mariusz Woźniak
doaj +1 more source
Teaching and learning discrete mathematics
In this paper, we provide an overall perspective on the teaching and learning of discrete mathematics. Our aim is to highlight what research has been conducted in this area and to connect it to existing research ideas for future work.
J. Sandefur+3 more
semanticscholar +1 more source
Real world applications of discrete mathematics
Discrete mathematics is an important branch of applied mathematics and graph theory is an important part of discrete mathematics. It have lot of applications in modern society.
Sk Amanathulla, B. Bera, M. Pal
semanticscholar +1 more source
Time-stage driven pathfinding framework for optimized medical treatments
Coming up with the correct patient-specific treatment procedure is a non-trivial task. One of the main challenges is that the problem is combinatorial, and each treatment can be followed by numerous treatments.
Karen Gishyan+2 more
doaj +1 more source
Decomposing 10-Regular Graphs into Paths of Length 5
Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Xie Mengmeng, Zhou Chuixiang
doaj +1 more source
The purpose of this study is to determine whether the flipped learning method via MOODLE can improve learning outcomes and motivation to learn discrete mathematics during COVID-19 pandemic.
H. Mursyidah, R. P. Hermoyo, D. Suwaibah
semanticscholar +1 more source
In this volume, the authors present a self-contained introduction to discrete mathematics – the science of finite and countably infinite structures. In addition to taking a theoretical approach, they also include many practical exercises. The text covers a broad range of topics such as propositional logic, set theory as well as detailed treatments of ...
Boschini, Cecilia+2 more
openaire +2 more sources
In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which
Zhipeng Huang+3 more
doaj +1 more source
Generalized Hausdorff Operators on K̇α,qβ,pℝ and HK̇α,qβ,p,Nℝ in the Dunkl Settings
In the present paper, we obtain some new results, and we generalize some known results for the Hausdorff operators. We have studied the generalized Hausdorff operators Hα,φ on the Dunkl-type homogeneous weighted Herz spaces K̇α,qβ,pℝ and Dunkl Herz-type ...
Faouaz Saadi, Othman Tyr, Radouan Daher
doaj +1 more source
The extremal graphs with respect to their nullity
The nullity of a graph G, denoted by η ( G ) $\eta(G)$ , is the multiplicity of the eigenvalue zero of its adjacency matrix. In this paper, we determine all graphs with η ( G ) = n ( G ) − 2 m ( G ) − c ( G ) $\eta(G)=n(G) - 2m(G) -c(G)$ , where c ( G ) =
Sa Rula, An Chang, Yirong Zheng
doaj +1 more source