Results 101 to 110 of about 26,105 (190)
The Well-Covered Dimension Of Products Of Graphs
Discussiones Mathematicae Graph Theory, 2014 We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy ...
Birnbaum Isaac +4 more
doaj +1 more source
On wreathed lexicographic products of graphs
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On alpha labeling of tensor product of paths and cycles. [PDF]
Heliyon, 2023 L U, G R.
europepmc +1 more source
Modern regenerative medicine dictionary: an augmented guide to biotherapy. [PDF]
Regen Med, 2023 Terzic A.
europepmc +1 more source
Sulfate limitation increases specific plasmid DNA yield and productivity in E. coli fed-batch processes. [PDF]
Microb Cell Fact, 2023 Gotsmy M +6 more
europepmc +1 more source
Hamiltonian properties in generalized lexicographic products
Discussiones Mathematicae Graph Theory19 pages, 2 ...
Jan Ekstein, Jakub Teska
openaire +3 more sources
Editorial: Recent advances in cervical cancer radiotherapy. [PDF]
Front Oncol, 2023 Varlotto JM, Cardarelli GA.
europepmc +1 more source
Vertex pancyclicity over lexicographic products
AKCE International Journal of Graphs and Combinatorics, 2022 Artchariya Muaengwaeng +2 more
openaire +1 more source
Lexicographic products and lexicographic powers of graphs -- a walk matrix approach
The characteristic polynomial and the spectrum of the lexicographic product of graphs $H[G]$, a specific instance of the generalized composition (also called $H$-join), are explicitly determined for arbitrary graphs $H$ and $G$, in terms of the eigenvalues of $G$ and an $H[G]$ associated matrix $\widetilde{\bf W}$, which relates $H$ with $G$.
Cardoso, Domingos M. +4 more
openaire +2 more sources