نتایج جستجو برای: signless laplacian
تعداد نتایج: 12702 فیلتر نتایج به سال:
Let D be a digraph with n vertices and arcs. The Laplacian the signless matrices of are, respectively, defined as L(D)=Deg+(D)−A(D) Q(D)=Deg+(D)+A(D), where A(D) represents adjacency matrix Deg+(D) diagonal whose elements are out-degrees in D. We derive combinatorial representation regarding first few coefficients (signless) characteristic polynomial provide concrete directed motifs to highligh...
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید