Results 61 to 70 of about 11,796 (253)

Partitioning Chordal Graphs

Electronic Notes in Discrete Mathematics, 2011
Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi   +2 more
openaire   +1 more source

MusicSwarm: Biologically Inspired Intelligence for Music Composition

Advanced Intelligent Systems, EarlyView.
Biologically inspired swarms of frozen foundation models self‐organize to compose complex music without fine‐tuning. By coordinating through stigmergic signals, decentralized agents dynamically evolve specialized roles and adapt to solve complex tasks.
Markus J. Buehler
wiley   +1 more source

The Topological Connectivity of the Independence Complex of Circular-Arc Graphs

Universal Journal of Mathematics and Applications, 2019
Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj   +1 more source

Chlorella vulgaris biorefineries: sustainable biofuels and high‐value carbon capture

Biofuels, Bioproducts and Biorefining, EarlyView.
Abstract Global reliance on fossil fuels has created urgent economic and environmental challenges, yet large‐scale use of algal biomass remains limited by production costs. Industrial scaling is constrained by inefficient harvesting and the technical challenges of processing recalcitrant cell walls.
Sandyelle Ferreira Alcântara Araújo, Antonio Átila Menezes Ferreira, Lucia Andrea Sindeaux de Oliveira, Dayana Nascimento Dari, Devany Quintela Soares, Eliana Elisa Francelino Mavie, Francisco Leonardo Alves de Moraes Sousa, Jessica Lopes da Silva, João Vitor Gomes de Araújo Silva, Thiago Queiroz da Silva, Ana Karine Portela Vasconcelos, Kelma Maria dos Santos Pires Cavalcante, John Hebert da Silva Felix, José Cleiton Sousa dos Santos   +13 more
wiley   +1 more source

Unveiling the Microvasculature: The Index of Microcirculatory Resistance and Its Expanding Role in Cardiovascular Care

Catheterization and Cardiovascular Interventions, EarlyView.
ABSTRACT Index of microcirculatory resistance (IMR) is a cutting‐edge, wire‐based tool that advances the capability assessment of coronary microvascular function. By utilizing distal coronary pressure and mean transit time under maximal hyperemia, IMR delivers consistent, reproducible insights into the microvasculature's dynamic health.
Joanna Sohn, Matthew A. Soderstrom, Ariana Ramirez, John‐Henry Dean, Raj Shah, Debanshu Roy, Kenneth Stone, Ariel Vinas, Bryan Ramsey, Charles Lin, Robert Chilton   +10 more
wiley   +1 more source

Graphs of Bounded Chordality

The Electronic Journal of Combinatorics
 A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Chaniotis, Aristotelis, Miraftab, Babak, Spirkl, Sophie   +2 more
openaire   +2 more sources

Advancing mine pillar design: Evaluating traditional methods and integrating AI for enhanced stability of pillars in the Great Dyke, Zimbabwe

Deep Underground Science and Engineering, EarlyView.
B1 is bord width 1, B2 is bord width 2, L is the pillar length, W is the pillar width, red color and letter A represent the pillars, and white color and number 1 represent excavated areas. Pstress is the average pillar stress; σv is the vertical component of the virgin stress, MPa; and e is the areal extraction ratio. e = B o B o + B P ${\rm{e}}=\frac{{
Tawanda Zvarivadza, Hendrik Grobler, Peter Apata Olubambi, Moshood Onifade, Manoj Khandelwal   +4 more
wiley   +1 more source

Requiring that Minimal Separators Induce Complete Multipartite Subgraphs

Discussiones Mathematicae Graph Theory, 2018
Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj   +1 more source

On a Class of Graphs with Large Total Domination Number [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj   +1 more source

Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs

Comptes Rendus. Mathématique, 2021
The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated Eulerian polynomial was recently introduced by Ashraf, Yoshinaga and the first author, which brings the characteristic and Ehrhart quasi-polynomials into ...
Tran, Tan Nhat, Tsuchiya, Akiyoshi
doaj   +1 more source