Results 51 to 60 of about 1,156,434 (264)
Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
Discrete Dynamics in Nature and Society, 2020 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices.
Gai-Xiang Cai, Xing-Xing Li, Gui-Dong Yu
doaj +1 more source
8-star-choosability of a graph with maximum average degree less than 3 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Min Chen, André Raspaud, Weifan Wang
doaj +1 more source
Maximum likelihood degree of surjective rational maps
Arnold Mathematical Journal, 2022 With any \emph{surjective rational map} $f: \p^n \dashrightarrow \p^n$ of the projective space we associate a numerical invariant (\emph{ML degree}) and compute it in terms of a naturally defined vector bundle $E_f \map \p^n$.
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Alveolar soft part sarcoma (ASPS) is a rare soft tissue sarcoma occurring most commonly in adolescence and young adulthood. Methods We present the clinical characteristics, treatments, and outcomes of patients with newly diagnosed ASPS enrolled on the Children's Oncology Group study ARST0332.
Jacquelyn N. Crane +11 more
wiley +1 more source
Connected domination value in graphs
Electronic Journal of Graph Theory and Applications, 2021 In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V \ D, there exists u ∈ D such that u and v are adjacent, and the subgraph〈D〉induced by D in G is connected.
Angsuman Das
doaj +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Maximizing Algebraic Connectivity via Minimum Degree and Maximum Distance
IEEE Access, 2018 Algebraic connectivity, the second smallest eigenvalue of the graph Laplacian matrix, is a fundamental performance measure in various network systems, such as multi-agent networked systems.
Gang Li +3 more
doaj +1 more source
Minimum Maximum Degree Publish-Subscribe Overlay Network Design [PDF]
IEEE INFOCOM 2009, 2009 Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. It is only natural then to formalize the following problem: Given a
Onus, Melih, Richa, A.W.
openaire +2 more sources
By dawn or dusk—how circadian timing rewrites bacterial infection outcomes
FEBS Letters, EarlyView.The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo +2 more
wiley +1 more source
Vizing's 2‐Factor Conjecture Involving Large Maximum Degree [PDF]
Journal of Graph Theory, 2017 AbstractLet G be an n‐vertex simple graph, and let and denote the maximum degree and chromatic index of G, respectively. Vizing proved that or . Define G to be Δ‐critical if and for every proper subgraph H of G. In 1965, Vizing conjectured that if G is an n‐vertex Δ‐critical graph, then G has a 2‐factor.
Chen, Guantao, Shan, Songling
openaire +3 more sources