نتایج جستجو برای: lexicographic product tensor product

تعداد نتایج: 320801  

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.

2001
Z. S. Sazonova Ranjit Singh

The properties and applications of kronecker product in quantum theory is studied thoroughly. The use of kronecker product in quantum information theory to get the exact spin Hamiltonian is given. The proof of non-commutativity of matrices, when kronecker product is used between them is given. It is shown that the non-commutative matrices after kronecker product are similar or they are similar ...

Journal: :Journal of Information and Optimization Sciences 2018

Journal: :Proceedings of the Japan Academy, Series A, Mathematical Sciences 1970

Journal: :iranian journal of fuzzy systems 2014
hongxing liu

let $r$ be a commutative ring. we write $mbox{hom}(mu_a, nu_b)$ for the set of all fuzzy $r$-morphisms from $mu_a$ to $nu_b$, where $mu_a$ and $nu_b$ are two fuzzy $r$-modules. we make$mbox{hom}(mu_a, nu_b)$ into fuzzy $r$-module by redefining a function $alpha:mbox{hom}(mu_a, nu_b)longrightarrow [0,1]$. we study the properties of the functor $mbox{hom}(mu_a,-):frmbox{-mod}rightarrow frmbox{-mo...

Journal: :Linear Algebra and its Applications 2020

Journal: :Electr. J. Comb. 2013
Bostjan Frelih Stefko Miklavic

A regular nonempty graph Γ is called edge regular, whenever there exists a nonegative integer λΓ, such that any two adjacent vertices of Γ have precisely λΓ common neighbours. An edge regular graph Γ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a nonegative integer μΓ, such that any two vertices at distance 2 have precisely μΓ common neighbours...

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید