Results 61 to 70 of about 1,327,272 (305)

Unordered Love in infinite directed graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1992
A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj   +1 more source

On the distance spectrum of certain distance biregular graphs

open access: yesThe American Journal of Combinatorics, 2023
In this article we present an infinite family of bipartite distance biregular graphs having an arbitrarily large diameter and whose distance matrices have exactly four distinct eigenvalues. This result answers a question posed by F.
Miriam Abdon   +2 more
doaj   +1 more source

LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro

open access: yesMolecular Oncology, EarlyView.
Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix   +13 more
wiley   +1 more source

Pair L(2, 1)-Labelings of Infinite Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj   +1 more source

On Laplacian Equienergetic Signed Graphs

open access: yesJournal of Mathematics, 2021
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj   +1 more source

On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs

open access: yesMathematics, 2022
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj   +1 more source

Infrared laser sampling of low volumes combined with shotgun lipidomics reveals lipid markers in palatine tonsil carcinoma

open access: yesMolecular Oncology, EarlyView.
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff   +11 more
wiley   +1 more source

Cycle Double Covers of Infinite Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.
Javaheri Mohammad
doaj   +1 more source

Correlation of the differential expression of PIK3R1 and its spliced variant, p55α, in pan‐cancer

open access: yesMolecular Oncology, EarlyView.
PIK3R1 undergoes alternative splicing to generate the isoforms, p85α and p55α. By combining large patient datasets with laboratory experiments, we show that PIK3R1 spliced variants shape cancer behavior. While tumors lose the protective p85α isoform, p55α is overexpressed, changes linked to poorer survival and more pronounced in African American ...
Ishita Gupta   +10 more
wiley   +1 more source

On cyclic orthogonal double covers of circulant graphs by special infinite graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
doaj   +1 more source

Home - About - Disclaimer - Privacy