Results 61 to 70 of about 235,976 (317)
Cartesian symmetry classes associated with certain subgroups of $S_m$ [PDF]
International Journal of Group TheoryIn this paper, the problem existing $O$-basis for Cartesian symmetry classes is discussed. The dimensions of Cartesian symmetry classes associated with a cyclic subgroup of the symmetric group $S_m$ (generated by a product of disjoint cycles) and the ...
Seyyed Sadegh Gholami, Yousef Zamani
doaj +1 more source
On Well-Covered Cartesian Products [PDF]
Graphs and Combinatorics, 2018 12 pages, 2 ...
Bert L. Hartnell +2 more
openaire +3 more sources
Asymptotics of the Euler number of bipartite graphs
, 2007 We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima.
Ehrenborg +4 more
core +1 more source
Advanced Functional Materials, EarlyView.Advances in integrating artificial intelligence into 3D bioprinting are systematically reviewed here. Machine learning, computer vision, robotics, natural language processing, and expert systems are examined for their roles in optimizing bioprinting parameters, real‐time monitoring, quality control, and predictive maintenance.
Joao Vitor Silva Robazzi +10 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Thermal transport in Ru and W thin films is studied using steady‐state thermoreflectance, ultrafast pump–probe spectroscopy, infrared‐visible spectroscopy, and computations. Significant Lorenz number deviations reveal strong phonon contributions, reaching 45% in Ru and 62% in W.
Md. Rafiqul Islam +14 more
wiley +1 more source
An improvement in the two-packing bound related to Vizing's conjecture
Theory and Applications of Graphs, 2020 Vizing's conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs.
Kimber Wolff
doaj +1 more source
Geodesic bipancyclicity of the Cartesian product of graphs
Theory and Applications of Graphs, 2022 A cycle containing a shortest path between two vertices $u$ and $v$ in a graph $G$ is called a $(u,v)$-geodesic cycle. A connected graph $G$ is geodesic 2-bipancyclic, if every pair of vertices $u,v$ of it is contained in a $(u,v)$-geodesic cycle of ...
Amruta Shinde, Y.M. Borse
doaj +1 more source
Dominating Cartesian products of cycles
Discrete Applied Mathematics, 1995 A set of vertices \(D\) in a graph is dominating if every vertex of the graph is adjacent to some vertex from \(D\). The domination number of the graph is the size of a smallest dominating set. The paper discusses the computation of the domination number of Cartesian products of graphs and an algorithm for finding minimum dominating sets in such graphs.
Sandi Klavžar, Norbert Seifter
openaire +3 more sources
On Linkedness of Cartesian Product of Graphs [PDF]
, 2014 We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of
Meszaros, Gabor
core
Band Alignment in In‐Oxo Metal Porphyrin SURMOF Heterojunctions
Advanced Functional Materials, EarlyView.Porphyrin core metalation in indium‑oxo SURMOFs enables systematic tuning of band edge positions without altering the crystal structure. First‑principles calculations reveal type‑I and type‑II heterostructures as well as multi‑junction energy cascades, establishing a modular strategy for exciton funneling and charge separation in optoelectronic ...
Puja Singhvi, Nina Vankova, Thomas Heine
wiley +1 more source