Results 51 to 60 of about 120,514 (220)

A new method for computing the vertex PI index with applications to special classes of graphs

AKCE International Journal of Graphs and Combinatorics
The Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju, K. Somasundaram, Yilun Shang   +2 more
doaj   +1 more source

Simultaneously dominating all spanning trees of a graph

Electronic Journal of Graph Theory and Applications, 2022
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann, Sven O. Krumke, Manuel Streicher   +2 more
doaj   +1 more source

Polynomial kernels for edge modification problems towards block and strictly chordal graphs [PDF]

arXiv, 2022
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block graph or a strictly chordal graph.
arxiv  

Linking preclinical models to clinical realities: VEGF/VEGFR inhibitors and thrombotic microangiopathy in cancer therapy

iMetaOmics, EarlyView.
This study investigates the risk of thrombotic microangiopathy (TMA) induced by vascular endothelial growth factor (VEGF) and vascular endothelial growth factor receptor (VEGFR) inhibitors in cancer therapy. Using data from the FDA Adverse Event Reporting System (FAERS), the WHO Global Database for Adverse Drug Reactions (Vigibase), and The Cancer ...
Aimin Jiang, Zhanzhi Li, Ying Liu, Junyi Shen, Quan Cheng, Anqi Lin, Peng Luo, Linhui Wang   +7 more
wiley   +1 more source

On minimally tough chordal graphs [PDF]

arXiv, 2022
Katona and Varga showed that for any rational number $t \in (1/2,1]$, no chordal graph is minimally $t$-tough. We conjecture that no chordal graph is minimally $t$-tough for $t>1/2$ and prove several results supporting the conjecture. In particular, we show that for $t>1/2$, no strongly chordal graph is minimally $t$-tough, no split graph is minimally $
arxiv  

Easy‐to‐morph printable conductive Marangoni‐driven 3D microdome geometries for fingertip‐curved e‐skin array with an ultragentle linear touch

InfoMat, EarlyView.
We printed various 3D conductive microdome geometries using a single direct printing method. Hierarchical dome structures provide linear and sensitive pressure sensing. We applied the hierarchical dome‐structured pressure sensor to a robotic finger, demonstrating its effectiveness in shine muscat harvesting, fine needle sensing, and droplet control ...
Seung Hwan Jeon, Hyeongho Min, Gui Won Hwang, Jihun Son, Han Joo Kim, Da Wan Kim, Yeon Soo Lee, Chang Hyun Park, Cheonyang Lee, Hyoung‐Min Choi, Jinseok Jang, Bo‐Gyu Bok, Tae‐Heon Yang, Min‐Seok Kim, Changhyun Pang   +14 more
wiley   +1 more source

On Chordal Graph and Line Graph Squares [PDF]

arXiv, 2017
In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize the chordality of graph squares by forbidden subgraphs.
arxiv  

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem

Journal of Graph Theory, EarlyView.
ABSTRACT Given a hypergraph H ${\rm{ {\mathcal H} }}$, the dual hypergraph of H ${\rm{ {\mathcal H} }}$ is the hypergraph of all minimal transversals of H ${\rm{ {\mathcal H} }}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another.
Endre Boros, Vladimir Gurvich, Martin Milanič, Yushi Uno   +3 more
wiley   +1 more source

The Topological Connectivity of the Independence Complex of Circular-Arc Graphs

Universal Journal of Mathematics and Applications, 2019
Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj   +1 more source

Automated extraction of right whale morphometric data from drone aerial photographs

Remote Sensing in Ecology and Conservation, EarlyView.
Aerial photogrammetry is a popular non‐invasive method for measuring marine mammal body size, body morphometrics, and body condition, but processing large datasets efficiently remains challenging. We developed a machine learning algorithm using Mask R‐CNN models to automatically measure body morphometrics of southern right whales from aerial ...
Chhandak Bagchi, Josh Medina, Duncan J. Irschick, Subhransu Maji, Fredrik Christiansen   +4 more
wiley   +1 more source