Results 21 to 30 of about 285,444 (268)
Energy Conditions for Hamiltonian and Traceable Graphs
A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +1 more source
Construction Of an Ideal Topological Space From Undirected Graphs
Graph theory, which is used effectively in many field from science to liberal arts, has very important place in our lives. As a result of this , the ideal topological structure of the graphs is studied by many researchers.
noor noaman alown Aljeafry
doaj +1 more source
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of the mapping to the cycle is the identity map.
Haney, Samuel +5 more
openaire +4 more sources
On the distance spectra of m-generation n-prism graph
The distance matrix of a simple connected graph G is [Formula: see text] where dij is the length of a shortest path between the ith and jth vertices of G. Eigenvalues of D(G) are called the distance eigenvalues of G. The m-generation n-prism graph or (m,
Fouzul Atik +2 more
doaj +1 more source
Bridge and cycle degrees of vertices of graphs
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 +2 more
doaj +1 more source
Negative (and positive) circles in signed graphs: A problem collection
A signed graph is a graph whose edges are labeled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles. Here I describe
Thomas Zaslavsky
doaj +1 more source
The distance magic property and two families of Cartesian product graphs
Let G = G(V, E) be a simple graph. The graph G is said to be distance magic if there exists a bijection f : V → {1, 2, …, |V|} and a constant s such that Σy ∈ N(x)f(y)=s for all x ∈ V.
Patrick Thomas Headley
doaj +1 more source
Dietary Protein Intake and Peritoneal Protein Losses in Peritoneal Dialysis Patients
ABSTRACT Introduction Peritoneal dialysis (PD) patients lose protein in their waste dialysate, potentially increasing their risk for malnutrition. We wished to determine whether there was any association between losses and dietary protein intake (DPI). Methods DPI was assessed from 24‐h dietary recall using Nutrics software.
Haalah Shaaker, Andrew Davenport
wiley +1 more source
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
Novel Properties of Fuzzy Labeling Graphs
The concepts of fuzzy labeling and fuzzy magic labeling graph are introduced. Fuzzy magic labeling for some graphs like path, cycle, and star graph is defined. It is proved that every fuzzy magic graph is a fuzzy labeling graph, but the converse is not
A. Nagoor Gani +2 more
doaj +1 more source

