Results 41 to 50 of about 59,909 (247)
A New Framework to Approach Vizing’s Conjecture
Discussiones Mathematicae Graph Theory, 2021 We introduce a new setting for dealing with the problem of the domination number of the Cartesian product of graphs related to Vizing’s conjecture. The new framework unifies two different approaches to the conjecture.
Brešar Boštjan +4 more
doaj +1 more source
Cartesian Products of Graphs and Metric Spaces
European Journal of Combinatorics, 2000 The authors give a short proof of the known fact that decomposition of a connected graph into a cartesian product of indecomposable factors is unique up to isomorphism. They then present a generalization of the results which shows uniqueness of decomposition for a wide class of product operations on general finite metric spaces.
Avgustinovich, S., Fon-Der-Flaass, D.
openaire +1 more source
The Thickness of Amalgamations and Cartesian Product of Graphs
Discussiones Mathematicae Graph Theory, 2017 The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been ...
Yang Yan, Chen Yichao
doaj +1 more source
Weak k-reconstruction of cartesian product graphs
Electronic Notes in Discrete Mathematics, 2001 By Ulam's conjecture every finite graph ▫$G$▫ can be reconstructed from its deck of vertex deleted subgraphs. The conjecture is still open, but many special cases have been settled. In particular, one can reconstruct Cartesian products. We consider the case of ▫$k$▫-vertex deleted subgraphs of Cartesian products and prove that one can decide whether a ...
Imrich, Wilfried +2 more
openaire +2 more sources
Clean Up Behind You ‐ Novel Patterning Approach for Solid Immersion Lenses
Advanced Functional Materials, EarlyView.A focused ion beam (FIB) milling strategy enables rapid fabrication of solid immersion lenses (SILs) with smooth, debris‐free surfaces eliminating the need for post‐processing. The optimized pattern improves efficiency and surface quality. SILs containing NV centers are also investigated, confirming the technique's suitability for quantum and photonic ...
Aleksei Tsarapkin +10 more
wiley +1 more source
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
Eccentric Harmonic Index for the Cartesian Product of Graphs
Journal of Mathematics, 2022 Suppose ρ is a simple graph, then its eccentric harmonic index is defined as the sum of the terms 2/ea+eb for the edges vavb, where ea is the eccentricity of the ath vertex of the graph ρ. We symbolize the eccentric harmonic index (EHI) as He=Heρ.
Kamel Jebreen +5 more
doaj +1 more source
Advanced Materials Technologies, EarlyView.One‐dimensional C4N2H14PbBr4 is shown to have a quasi‐direct electronic band structure and strongly anisotropic transport with polarized broadband emission. A GW/Bethe–Salpeter excited‐state force formalism, supported by polarized Raman and temperature‐dependent photoluminescence, identifies low–frequency Pb–Br phonons that drive ultrafast exciton self‐
Rijan Karkee +7 more
wiley +1 more source
International Journal of Mathematics for IndustryThis paper explores operations on fuzzy incidence graphs (FIGs), focusing on join, Cartesian product, tensor product, and composition. Emphasizing strong fuzzy incidence graphs (SFIGs), the study examines strong incidence domination (SID) and the strong ...
Kavya R. Nair, M. S. Sunitha
doaj +1 more source
Some Results on Palette Index of Cartesian Product Graphs
Mathematical Problems of Computer Science, 2021 Given a proper edge coloring α of a graph G, we define the palette SG(ν, α) of a vertex ν ∈ V (G) as the set of all colors appearing on edges incident to ν. The palette index š(G) of G is the minimum number of distinct palettes occurring in a proper edge
Khachik S. Smbatyan
doaj +1 more source