Results 41 to 50 of about 46,607 (299)

The Sigma Coindex of Graph Operations

open access: yesJournal of Mathematics, 2021
The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex.
Yasar Nacaroglu
doaj   +1 more source

Certain operations on interval-valued picture fuzzy graphs with application

open access: yesInternational Journal of Mathematics for Industry, 2023
Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari   +3 more
doaj   +1 more source

Ironic Medications: A Narrative‐Based Psycho‐Educational Intervention to Explore Patient–Provider Communication in Adolescents With Haematological Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Adolescents with haematological malignancies face significant emotional and relational challenges, often accompanied by difficulties in communicating their needs within the healthcare context. To address these issues, a narrative‐based psycho‐educational intervention based on the creation and prescription of Ironic Medications was ...
Marta Stoppa   +7 more
wiley   +1 more source

PGMJoins : random join sampling with graphical models [PDF]

open access: yes, 2021
Modern databases face formidable challenges when called to join (several) massive tables. Joins (especially when entailing many-to-many joins) are very time- and resource-consuming, join results can be too big to keep in memory, and performing analytics ...
Kurmanji, M.   +11 more
core   +1 more source

The Crossing Numbers of Join of Some Graphs with n Isolated Vertices

open access: yesDiscussiones Mathematicae Graph Theory, 2018
There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj   +1 more source

ANALISA OPTIMALISASI BAHASA SQL BERDASARKAN RELATIONAL ALGEBRA PADA KASUS REKAPITULASI MAHASISWA LAYAK WISUDA

open access: yesSimetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer, 2015
ABSTRAK Aljabar relasional sangat membantu adanya kemungkinan penggunaan sintaks bahasa SQL yang berlainan dalam masalah yang sama. Masalah yang digunakan sebagai eksperimen adalah kasus rekapitulasi data mahasiswa layak wisuda pada suatu perguruan ...
Eko Darmanto
doaj   +1 more source

Non-inclusive and inclusive distance irregularity strength for the join product of graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2022
A function ϕ: V(G)→{1, 2, …, k} of a simple graph G is said to be a non-inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the open neighborhood of every vertex are distinct and is said to be an inclusive distance ...
Faisal Susanto   +3 more
doaj   +1 more source

Natural Killer Cells in Paediatric Soft Tissue Sarcomas: A Systematic Review

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Paediatric soft tissue sarcomas (pSTS) are a rare and heterogeneous group of malignant tumours arising in tissues of mesenchymal origin. The role of natural killer (NK) cells in pSTS remains poorly understood, with evidence fragmented across small preclinical studies and early‐phase clinical trials.
Raya Dean   +7 more
wiley   +1 more source

On the set chromatic number of the join and comb product of graphs [PDF]

open access: yes, 2020
A vertex coloring c : V(G) → of a non-trivial connected graph G is called a set coloring if NC(u) ≠ NC(v) for any pair of adjacent vertices u and v. Here, NC(x) denotes the set of colors assigned to vertices adjacent to x. The set chromatic number of G,
Garciano, Agnes   +2 more
core   +1 more source

Distributed streaming set similarity join [PDF]

open access: yes, 2020
© 2020 IEEE. With the prevalence of Internet access and user generated content, a large number of documents/records, such as news and web pages, have been continuously generated in an unprecedented manner. In this paper, we study the problem of efficient
Wang, X   +9 more
core   +1 more source

Home - About - Disclaimer - Privacy