Results 51 to 60 of about 6,012,682 (310)

On primality of Cartesian product of graphs [PDF]

open access: yesArab Journal of Mathematical Sciences
PurposeThe present work focuses on the primality and the Cartesian product of graphs.Design/methodology/approachGiven a graph G, a subset M of V (G) is a module of G if, for a, b ∈ M and x ∈ V (G) \ M, xa ∈ E(G) if and only if xb ∈ E(G).
Nadia El Amri   +2 more
doaj   +1 more source

On Intuitionistic Fuzzy PMS-Ideals of a PMS-Algebra Under Homomorphism and Cartesian Product

open access: yesInternational Journal of Computational Intelligence Systems, 2023
In this paper, we use the concept of an intuitionistic fuzzy set to PMS-ideals in PMS-algebras. We discuss the notion of intuitionistic fuzzy PMS-ideals under homomorphism and Cartesian product and investigate several related properties. The homomorphism
Berhanu Assaye Alaba   +2 more
doaj   +1 more source

Imaging of Biphoton States: Fundamentals and Applications

open access: yesAdvanced Functional Materials, EarlyView.
Quantum states of two photons exhibit a rich polarization and spatial structure, which provides a fundamental resource of strongly correlated and entangled states. This review analyzes the physics of these intriguing properties and explores the various techniques and technologies available to measure them, including the state of the art of their ...
Alessio D'Errico, Ebrahim Karimi
wiley   +1 more source

Cartesian symmetry classes associated with certain subgroups of $S_m$ [PDF]

open access: yesInternational Journal of Group Theory
In 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 Linkedness of Cartesian Product of Graphs [PDF]

open access: yes, 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  

Hadwiger Number and the Cartesian Product Of Graphs

open access: yes, 2007
The Hadwiger number mr(G) of a graph G is the largest integer n for which the complete graph K_n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, mr(G) >= chi(G), where chi(G) is the chromatic number of G.
Chandran, L. Sunil   +2 more
core   +2 more sources

Beyond the Edge: Charge‐Transfer Excitons in Organic Donor‐Acceptor Cocrystals

open access: yesAdvanced Functional Materials, EarlyView.
Complex excitonic landscapes in acene–perfluoroacene cocrystals are unveiled by polarization‐resolved optical spectroscopy and many‐body theory. This systematic study of a prototypical model system for weakly interacting donor–acceptor compounds challenges common views of charge‐transfer excitons, providing a refined conceptual framework for ...
Sebastian Anhäuser   +6 more
wiley   +1 more source

Geodesic bipancyclicity of the Cartesian product of graphs

open access: yesTheory 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

The Cartesian product of graphs with loops [PDF]

open access: yes, 2014
We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one ...
Christiaan E. Van De Woestijne   +7 more
core  

Power domination of the cartesian product of graphs

open access: yesAKCE Int. J. Graphs Comb., 2016
In this paper, we first give a brief survey on the power domination of the Cartesian product of graphs. Then we conjecture a Vizing-like inequality for the power domination problem, and prove that the inequality holds when at least one of the two graphs ...
K. Koh, K. W. Soh
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy