Results 61 to 70 of about 6,540,046 (323)
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
Bar 1-Visibility Drawings of 1-Planar Graphs
, 2013 A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean +13 more
core +1 more source
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
Relations between the distinguishing number and some other graph parameters [PDF]
ریاضی و جامعهA distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi +1 more
doaj +1 more source
The competition number of a generalized line graph is at most two
, 2012 In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one.
Park, Boram, Sano, Yoshio
core +3 more sources
On hamiltonian line-graphs [PDF]
Transactions of the American Mathematical Society, 1968 Introduction. The line-graph L(G) of a nonempty graph G is the graph whose point set can be put in one-to-one correspondence with the line set of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire +1 more source
Projective dimension and regularity of the path ideal of the line graph [PDF]
, 2016 By generalizing the notion of the path ideal of a graph, we study some algebraic properties of some path ideals associated to a line graph. We show that the quotient ring of these ideals are always sequentially Cohen–Macaulay and also provide some exact ...
G. Zhu
semanticscholar +1 more source
Clique number of the square of a line graph [PDF]
Discrete Mathematics, 2015 We prove that the clique number of the square of a line graph of a graph G is at most 1.5 Δ G 2 and that the fractional strong chromatic index of G is at most 1.75 Δ G 2 .An edge coloring of a graph G is strong if each color class is an induced matching ...
Małgorzata Śleszyńska-Nowak
semanticscholar +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Graphs with odd and even distances between non-cut vertices [PDF]
Opuscula MathematicaWe prove that in a connected graph, the distances between non-cut vertices are odd if and only if it is the line graph of a strong unique independence tree.
Kateryna Antoshyna, Sergiy Kozerenko
doaj +1 more source