Search results

Strong chromatic index of \(K_4\)-minor free graphs 2017-10-18 Paper A tight neighborhood union condition on fractional $(g,f,n’,m)$-critical deleted graphs...

Conditional-(g, d, k)-Connectivity and Conditional-(g, d, k)-edge-Connectivity on the Hypercubes* 2020-11-16 Paper The reliability analysis of \(k\)-ary \(n\)-cube...

2017-01-12 Paper Operator equations \(AX+YB=C\) and \(AXA^\ast + BYB^\ast =C\) in Hilbert \(C^\ast\)-modules 2017-01-12 Paper Bulk and soft-edge universality...

equation \(y_{n+1}=\frac{\alpha \cdot \text{e}^{-(ny_n+(n-k)y_{n-k})}}{\beta +ny_n+(n-k)y_{n-k}}\) 2009-06-09 Paper \(C^1\)-regularity of solutions for...

Bunge-Wand-Weber ontological constructs 2002-06-05 Paper The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm 2002-06-05 Paper Interplay...

Paper https://portal.mardi4nfdi.de/entity/Q5124207 2020-09-17 Paper Finding k Partially Disjoint Paths in a Directed Planar Graph 2020-07-08 Paper New lower...

2022120 zbMATH Keywords digital topology\(C_{k^\ast}\)-adjacency\(DT\)-\(k\)-group\(G_{k^\ast}\)-adjacency\(G_{k^\ast}\)-continuitycompatible adjacencydigital...

if and only if H=G and D is obtained from G by a four-way switching operation; if G is connected, this happens if and only if lambda1(G)=lambda1(D). All...

cocycle c from G into a discrete group Gamma. We show that the collection A(G) of locally-constant, compactly supported functions on G is a dense *-subalgebra...

Abstract: Let G=(V(G),E(G)) be a simple graph with vertex set V(G)=v1,v2,cdots,vn and edge set E(G). The p-Sombor matrix mathcalSp(G) of G is the square...

other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization...

Journal in Brave) Abstract: Let H and G be two finite graphs. Define hH(G) to be the number of homomorphisms from H to G. The function hH(cdot) extends in...

there is an exact sequence () [ K_n(R)^{(E_0setminusSink(E))}stackrel{1-N_E^t}{longrightarrow} K_n(R)^{(E_0)} o K_n(L_R(E)) o K_{n-1}(R)^{(E_0setminusSink(E))}...

Boundary \({\boldsymbol{H^\ast}}\) -Polynomials of Rational Polytopes Symmetry Adapted Gram Spectrahedra Computing volumes of adjacency polytopes via Draconian...

graphpartial cyclic order\(\{0, 1\}\)-matrix\(G\)-cyclic order\(k\)-Entringer number\(k\)-Euler number\(k\)-Springer numberBoustrophedon recursioncolumn-convex...

combinatorial definition of chiq(G) to prove that many spectral lower bounds for the chromatic number, chi(G), are also lower bounds for chiq(G). This is achieved using...

large n, there exists a regular graph G of order n whose energy leftVertGightVertast satisfies [ leftVert G ightVert_{ast}>frac{1}{2}n^{3/2}-n^{13/10}. ] Several...

FREE BROWNIAN MOTION AND EVOLUTION TOWARDS ⊞-INFINITE DIVISIBILITY FOR k-TUPLES \({\ast}\)-freeness in finite tensor products This page was built for publication:...

f(A)kell decays exponentially with the shortest-path distance in G that separates either k or ell from the set of nodes touched by the edges that are perturbed...

code, etc. for problems pertaining to combinatorics (05-04) Cited In (97) Adjacency Matrices The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial...