Results 71 to 80 of about 1,529,529 (310)
On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
Open Mathematics, 2022 A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article,
Ling Bo, Lan Ting, Ding Suyun
doaj +1 more source
THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER
Barekeng, 2023 There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure..
Lalu Riski Wirendra Putra +4 more
doaj +1 more source
Some identities for enumerators of circulant graphs
, 2001 We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders.
Liskovets, Valery A.
core +1 more source
Molecular Oncology, EarlyView.PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham +21 more
wiley +1 more source
A Numerical Study on the Regularity of d-Primes via Informational Entropy and Visibility Algorithms
Complexity, 2020 Let a d-prime be a positive integer number with d divisors. From this definition, the usual prime numbers correspond to the particular case d=2. Here, the seemingly random sequence of gaps between consecutive d-primes is numerically investigated.
B. L. Mayer, L. H. A. Monteiro
doaj +1 more source
A construction of small regular bipartite graphs of girth 8 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let q be a prime a power and k an integer such that 3 ≤ k ≤ q. In this paper we present a method using Latin squares to construct adjacency matrices of k-regular bipartite graphs of girth 8 on 2(kq2 -- q) vertices.
Camino Balbuena
doaj +1 more source
Strong chromatic index of sparse graphs [PDF]
, 2013 A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $\chi_{s}^{\prime}(G)$, is the least number of colors in a strong edge coloring of $G$.
Dębski, Michał +2 more
core
Cartesian product of hypergraphs: properties and algorithms
, 2009 Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +4 more
core +4 more sources
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
Distance spectrum of some zero divisor graphs
AIMS MathematicsIn the present article, we give the distance spectrum of the zero divisor graphs of the commutative rings $ \mathbb{Z}_{t}[x]/\langle x^{4} \rangle $ ($ t $ is any prime), $ \mathbb{Z}_{t^2}[x] / \langle x^2 \rangle $ ($ t \geq 3 $ is any prime) and ...
Fareeha Jamal , Muhammad Imran
doaj +1 more source