Results 71 to 80 of about 5,992,367 (377)
Brushing Number and Zero-Forcing Number of Graphs and their Line Graphs [PDF]
, 2016 In this paper we compare the brushing number of a graph with the zero-forcing number of its line graph. We prove that the zero-forcing number of the line graph is an upper bound for the brushing number by constructing a brush configuration based on a zero-forcing set for the line graph.
arxiv +1 more source
On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions [PDF]
, 2017 In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph ...
Bryant, Darryn +2 more
core +1 more source
Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format. [PDF]
, 2015 The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987) has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on ...
Ali +33 more
core +2 more sources
FEBS Letters, EarlyView.The mitochondrial outer membrane iron–sulphur ([Fe‐S]) protein mitoNEET is a target of the type‐2 diabetes drug pioglitazone. Its unknown molecular function is linked to respiratory complex activity and mitochondrial function. We discovered that O2 protects the mitoNEET [2Fe‐2S] cluster against NO oxidation and desensitization towards reduction by H2S.
Thao Nghi Hoang +9 more
wiley +1 more source
Computing Topological Indices and Polynomials for Line Graphs
Mathematics, 2018 A topological index is a number related to the atomic index that allows quantitative structure–action/property/toxicity connections. All the more vital topological indices correspond to certain physico-concoction properties like breaking point ...
Shahid Imran +3 more
doaj +1 more source
Whitney's Theorem for Line Graphs of Multi-Graphs [PDF]
arXiv, 2021 Whitney's Theorem states that every graph, different from $K_3$ or $K_{1,3}$, is uniquely determined by its line graph. A $1$-line graph of a multi-graph is the graph with as vertices the edges of the multi-graph, and two edges adjacent if and only if there is a unique vertex on both edges.
arxiv
Scattering theory and discrete-time quantum walks
, 2004 We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each.
Ambainis +21 more
core +1 more source
FEBS Letters, EarlyView.This study explores the distinct molecular mechanisms underlying Lynch syndrome‐associated and sporadic colorectal cancer (CRC). By highlighting the therapeutic potential of targeting the PI3K‐Akt pathway in Lynch syndrome‐associated CRC and the Wnt pathway in sporadic CRC, the findings open avenues for personalised treatment strategies, aiming to ...
May J. Krause +2 more
wiley +1 more source
The M-polynomial of line graph of subdivision graphs
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2019 Three composite graphs Ladder graph (L_{n}), Tadpole graph (T_{n,k}) and Wheel graph (W_{n}) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc. In this report, we first determine M-polynomial of
S. Mondal, Nilanjan De, A. Pal
semanticscholar +1 more source
Line-distortion, Bandwidth and Path-length of a graph [PDF]
, 2014 We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition.
A. Gupta +15 more
core +1 more source