Results 51 to 60 of about 2,715,030 (252)

Decomposing dense bipartite graphs into 4-cycles [PDF]

open access: yes, 2015
Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4.
Nicholas J. Cavenagh   +1 more
core  

Leveraging Symbolic Artificial Intelligence and Fuzzy Logic for Materials Science: A Review of Methods, Challenges, and Applications to Scarce and Imperfect Experimental Data

open access: yesAdvanced Engineering Materials, EarlyView.
This article explores the transformative potential of symbolic artificial intelligence (AI) in the field of materials science, particularly in leveraging experimental data. The article presents several symbolic AI models and discusses their applications in materials science.
Ahmed Amrani   +7 more
wiley   +1 more source

Complexity of Roman {2}-domination and the double Roman domination in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Chakradhar Padamutham   +1 more
doaj   +1 more source

Advances in 3D Bioprinting for Breast Cancer Modeling: Tumor Microenvironment, Metastasis, and Drug Screening

open access: yesAdvanced Healthcare Materials, EarlyView.
Three‐dimensional bioprinting transforms breast cancer modeling from simple constructs into spatially organized, multicellular, perfused, and patient‐derived platforms. This review shows how bioinks, cellular composition, architecture, and flow govern tumor behavior and drug response, while revealing why complexity alone is insufficient without ...
Mustafa Nakipoglu   +7 more
wiley   +1 more source

m-Bonacci graceful labeling

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam   +1 more
doaj   +1 more source

Large-girth roots of graphs [PDF]

open access: yes, 2010
We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus
Adamaszek, Michal   +4 more
core   +1 more source

Data‐Driven Materials Science for Energy‐Sustainable Applications

open access: yesAdvanced Materials, EarlyView.
Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
wiley   +1 more source

Star Bicolouring of Bipartite Graphs

open access: yesAlgorithms
We give an integer linear program formulation for the star bicolouring of bipartite graphs. We develop a column generation method to solve the linear programming relaxation to obtain a lower bound for the minimum number of colours needed.
Daya Gaur   +2 more
doaj   +1 more source

MAPA: A Semantic Network Framework for Functional Module Discovery and Interpretation in Multi‐Omics Data

open access: yesAdvanced Science, EarlyView.
MAPA transforms complex multi‐omics data into biologically coherent functional modules by integrating pathway information with molecular interaction networks. Retrieval‐augmented large language models then generate structured, literature‐informed interpretations.
Yifei Ge   +13 more
wiley   +1 more source

Decomposition of complete bipartite graphs into cycles and stars with four edges

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let Ck, Sk denote a cycle, star with k edges and let Km,n denotes a complete bipartite graph with m and n vertices in the parts. In this paper, we obtain necessary and sufficient conditions for the existence of a decomposition of complete bipartite ...
M. Ilayaraja, A. Muthusamy
doaj   +1 more source

Home - About - Disclaimer - Privacy