Results 51 to 60 of about 3,967,804 (356)

Vertex Degree Weighted Path Indices

Acta Chimica Slovenica, 2016
Vertex degree weighted path indices P(N)(a, b, ...), for example P(1)(a, b), P(2)(a, b, c), P(3)(a, b, c, d), and P(4)(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|(max) up to 0.999. Mutually optimized combinations of them are even better, R (P(1)..P(4)) is in the worst tested case > 0.9 ...
openaire   +5 more sources

Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions

Theory and Applications of Graphs
Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj   +1 more source

Bridge and cycle degrees of vertices of graphs

International Journal of Mathematics and Mathematical Sciences, 1984
The bridge degree bdeg v and cycle degree cdeg v of a vertex v in a graph G are, respectively, the number of bridges and number of cycle edges incident with v in G. A characterization of finite nonempty sets S of nonnegative integers is given for which S
Gary Chartrand, Farrokh Saba, Nicholas C. Wormald   +2 more
doaj   +1 more source

Some results on the palette index of graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
Given a proper edge coloring $\varphi$ of a graph $G$, we define the palette $S_{G}(v,\varphi)$ of a vertex $v \in V(G)$ as the set of all colors appearing on edges incident with $v$.
C. J. Casselgren, Petros A. Petrosyan
doaj   +1 more source

Vertex Operators in $AdS_3\times S^3$ Background with NS_NS Flux using Berkovits-Vafa-Witten Variables

, 2000
String equations for the vertex operators of type IIB on $AdS_3\times S^3$ background with NS-NS flux are calculated using Berkovits-Vafa-Witten formalism.
Balog, Bars, Berkovits, Berkovits, Berkovits, de Boer, de Boer, Deger, Dolan, Evans, Friedan, Giveon, Green, Hennigson, Henningson, Hosomichi, Hwang, Hwang, Kutasov, Kutasov, Larsen, M. Langham, Maldacena, Mohammedi, Petropoulos, Romans, Satoh, Teschner, Teschner   +28 more
core   +1 more source

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

FEBS Open Bio, EarlyView.
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li, Xi Xiao, Lingbin Qi, Chanyi Li, Sirui Song, Jiaying Qin, Zhigang Xue, Jinfeng Xue, Huaifang Li   +8 more
wiley   +1 more source

On the Vertex-Connectivity of an Uncertain Random Graph

IEEE Access, 2020
In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which ...
Hao Li, Xin Gao
doaj   +1 more source

On Omega Index and Average Degree of Graphs

Journal of Mathematics, 2021
Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences.
Sadik Delen, Musa Demirci, Ahmet Sinan Cevik, Ismail Naci Cangul   +3 more
doaj   +1 more source

Diffusion Tractography Biomarker for Epilepsy Severity in Children With Drug‐Resistant Epilepsy

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To develop a novel deep‐learning model of clinical DWI tractography that can accurately predict the general assessment of epilepsy severity (GASE) in pediatric drug‐resistant epilepsy (DRE) and test if it can screen diverse neurocognitive impairments identified through neuropsychological assessments.
Jeong‐Won Jeong, Min‐Hee Lee, Hiroshi Uda, Yoon Ho Hwang, Michael Behen, Aimee Luat, Csaba Juhász, Eishi Asano   +7 more
wiley   +1 more source

Topological indices are not necessarily invariant to graph labeling

Acta Chimica Slovenica, 2015
Each element of the Universal matrix U (vertex-degree vertex-distance weighted matrix) represents the mutual contribution of two vertices weighted for the vertex degrees and the distance between them.
Anton Perdih
doaj   +1 more source