Results 51 to 60 of about 174,868,130 (283)

Degree Associated Reconstruction Parameters of Total Graphs [PDF]

open access: yes, 2017
A card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard) specifies the degree of the deleted vertex (edge) along with the card (ecard).
Monikandan, S., Anusha Devi, P.
core   +1 more source

The Role of Individual Edges in Edge Controllability of Complex Networks

open access: yesIEEE Access, 2020
Dynamical processes occurring on edges of complex networks are relevant to many real situations. Controlling the edge dynamics is a fundamental challenge in network science. Inspired by recent advances in the edge controllability theories, we explore the
Chao Li, Shaopeng Pang
doaj   +1 more source

Stability of Complement Degree Polynomial of Graphs

open access: yesمجلة بغداد للعلوم, 2023
     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of ...
Safeera K, Anil Kumar V
doaj   +1 more source

Edge degrees and dominating cycles

open access: yesDiscrete Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs [PDF]

open access: yes, 2017
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appearing on the edges incident to a vertex and its maximum monochromatic degree is defined as the maximum number of edges incident to a vertex with a same ...
Shinya Fujita   +5 more
core   +1 more source

Bridging the Loneliness Gap: Depression, Connectivity, and Isolation in Pediatric Oncology Patients and Their Peers

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Loneliness is associated with adverse physical and mental health outcomes and remains understudied in children and adolescents undergoing cancer therapy. Pediatric oncology patients may be at increased risk due to medical isolation and disruption of social networks.
Charlotte N. Stahlfeld   +5 more
wiley   +1 more source

Bridge-edge Identification Method of Command and Control Network Based on Bridging Coefficient [PDF]

open access: yesJisuanji gongcheng, 2019
The bridge-edge is the pivot of network structure connection and plays a crucial role in the flow of command and control network information.Accurately identifying and protecting the bridge edge can greatly improve the destruction resistance of the ...
GAO Xiue, CHEN Xiaoshuang, WANG Yunming, CHEN Bo
doaj   +1 more source

Impact of Radiation Therapy on Physical and Psychosocial Health of Adolescents and Young Adults: A Joint Report From the Children's Oncology Group AYA and Radiation Oncology Committees

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Rates of cancer among adolescents and young adults (AYA), age 15–39 years, are increasing. Consequently, radiation oncologists are treating more AYAs who have diagnoses spanning both pediatric and adult practices. Compared to pediatric and older adult patients, AYAs face a unique set of challenges.
Hesham Elhalawani   +7 more
wiley   +1 more source

Social Functioning Within the First Years After Pediatric Brain Tumor Diagnosis and the Relationship With Family Psychosocial Risk

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Survivors of pediatric brain tumors (PBTs) can experience long‐term social difficulties, impacting quality of life. Beyond medical and environmental factors, family psychosocial risk may play a role in social outcomes by shaping the caregiving environment and may provide intervention options.
Renske H. Houben   +4 more
wiley   +1 more source

Representations of Edge Intersection Graphs of Paths in a Tree [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy