Results 71 to 80 of about 2,449,773 (154)

Constructing cospectral graphs by unfolding non-bipartite graphs [PDF]

In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrices.
Wankhede, Hitesh, Kannan, M. Rajesh, Pragada, Shivaramakrishna   +2 more
core   +1 more source

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

Advanced Engineering Materials, Volume 28, Issue 20, 21 October 2026.
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, Mohamed‐Ali Belloum, Laurence Boudet, Valentin Fouillard, Edwin Friedmann, Guillaume Lacharme, Ali Mahmoud, Jean‐Philippe Poli   +7 more
wiley   +1 more source

Mixed Covering Arrays on Graphs

, 2008
. We give upper and lower bounds on the size of mixed covering arrays on graphs based on graph homomorphisms. We provide constructions for covering arrays on graphs based on basic graph operations.
Moura L
core  

Det-Extremal Cubic Bipartite Graphs

, 2003
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matrix A. We say G is det-extremal if per(A) = |det(A)|. Det-extremal k-regular bipartite graphs exist only for k = 2 or 3.
D. Labbate, B. JACKSON, LABBATE, Domenico, FUNK, Martin, M. Funk, Bill Jackson, J. SHEEHAN   +6 more
core   +1 more source

Independent Complementary Distance Pattern Uniform Graphs [PDF]

, 2009
A graph G =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2, ·· ·,Mk ⊂ V (G) such that fMi (u) ={d(u, v):v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k.
Koshy, Beena, Germina K.A., Germina K. A., Beena Koshy   +3 more
core   +1 more source

On bipartite-mixed graphs

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite.
Dalfó Simó, Cristina, Fiol Mora, Miquel Àngel, López Lorenzo, Nacho   +2 more
core  

On the cyclic decomposition of complete graphs into almost-bipartite graphs

, 2004
Techniques of labeling the vertices of a bipartite graph G with n edges to yield cyclic G-decompositions of the complete graph K2nx+1 have received much attention in the literature. Up until recently, these techniques have been used mostly with bipartite
Blinco, Andrew, Eynden, Charles Vanden, El-Zanati, Saad I.   +2 more
core   +1 more source

On The Domatic Number of Bipartite Permutation Graphs [PDF]

, 2009
[[abstract]]This paper studies the problem of partitioning the vertices of a graph G into disjoint set V1, …, Vq such that V1, …, Va are all dominating sets of G. The objective is to find the largest q.
Kai Wen Tsui;Chung-Kung Yen;Chuan Yi Tang
core  

Structural and Spectral Properties of Chordal Ring, Multi-Ring, and Mixed Graphs

The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of chordal multi-ring (
M. A. Reyes, C. Dalfó, M. A. Fiol, Reyes Quiróz, Mónica Andrea, Dalfó Simó, Cristina, Fiol Mora, Miquel Àngel   +5 more
core   +1 more source

Emergent charge crystallization and frustration in a particle anti-spin ice. [PDF]

Nat Commun
Baillou R, Terkel M, Nisoli C, Tierno P.
europepmc   +2 more sources