Results 51 to 60 of about 405,795 (217)
Journal of Engineering Technology and Applied PhysicsMathematical modelling based on the compartmental Susceptible – Exposed – Infected - Recovered (SEIR) model is proposed in this paper to study the pandemic outbreak.
Mei Feng Liu, Boo Hui Ling
doaj +1 more source
H - V -Super-Strong- ( a , d ) -antimagic decomposition of complete bipartite graphs [PDF]
, 2023 S. Stalin Kumar
openalex +1 more source
Discrete Applied Mathematics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hammer, Peter L., Maffray, Frédéric
openaire +2 more sources
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
A note on zero-divisor graph of amalgamated duplication of a ring along an ideal
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a commutative ring and be a non-zero ideal of . Let be the subring of consisting of the elements for and . In this paper we characterize all isomorphism classes of finite commutative rings with identity and ideal such that is planar.
A. Mallika, R. Kala
doaj +1 more source
Linear Algebra and its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shaked-Monderer, Naomi +3 more
openaire +3 more sources
A complete graph-based approach with multi-task learning for predicting synergistic drug combinations. [PDF]
Bioinformatics, 2023 Wang X +5 more
europepmc +1 more source
Consensus-Related Performance of Triplex MASs Based on Partial Complete Graph Structure. [PDF]
Entropy (Basel), 2022 Bian J, Huang D, Xu J, Yu Z.
europepmc +1 more source
Effects on Seidel energy of two special types of graphs by perturbing edges
Kuwait Journal of ScienceLet G be a simple undirected graph, and let S(G) be its Seidel matrix. The Seidel energy of G is defined as ES(G)=∑i=1n|λS(G)|, where λS(G),λS(G),…,λS(G) are Seidel eigenvalues of G.
doaj +1 more source