Results 21 to 30 of about 3,368,549 (267)
BMC Pulmonary Medicine, 2021 Background To explore the long-term trajectories considering pneumonia volumes and lymphocyte counts with individual data in COVID-19. Methods A cohort of 257 convalescent COVID-19 patients (131 male and 126 females) were included.
Nannan Shi +13 more
doaj +1 more source
Heliyon, 2023 The tessellation problem is interesting to study, especially when it is associated with mathematical concepts. In this study, a graph coloring technique will be applied to solve the problem of wallpaper tessellation decoration. The main objective of this
Dafik +4 more
doaj +1 more source
Graphs Cospectral with Kneser Graphs [PDF]
SSRN Electronic Journal, 2009 AMS Subject Classification ...
Haemers, W.H., Ramezani, F.
openaire +5 more sources
International Journal of Foundations of Computer Science, 2008 Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the same vertex and of which precisely one edge is enabled at any time. By using a Boolean function called a switch setting, the switches in a switching graph can be put in a fixed direction to obtain an ordinary graph.
Groote, J.F., Ploeger, B.
openaire +4 more sources
Forum of Mathematics, Sigma, 2019 An elastic graph is a graph with an elasticity associated to each edge. It may be viewed as a network made out of ideal rubber bands. If the rubber bands are stretched on a target space there is an elastic energy. We characterize when a homotopy class of maps from one elastic graph to another is loosening, that is, decreases this elastic energy for all
openaire +3 more sources
Proceedings of the ACM Multimedia 2017 Workshop on South African Academic Participation, 2017 We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph perspective. Since there seems to be a lack of algorithms to automatically construct valid cluster graphs, we provide ...
Streicher, Simon, Preez, Johan du
openaire +2 more sources
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
Graph Filtering Over Expanding Graphs
2022 IEEE Data Science and Learning Workshop (DSLW), 2022 Our capacity to learn representations from data is related to our ability to design filters that can leverage their coupling with the underlying domain. Graph filters are one such tool for network data and have been used in a myriad of applications.
Das, Bishwadeep, Isufi, Elvin
openaire +2 more sources
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
Embedding Graphs into Colored Graphs [PDF]
Transactions of the American Mathematical Society, 1988 If X X is a graph, κ \kappa a cardinal, then there is a graph Y Y such that if the vertex set of Y Y is κ \kappa -colored, then there exists a monocolored induced copy of X X ; moreover, if X X does not contain a complete graph on
Hajnal, András, Komjáth, P.
openaire +1 more source