نتایج جستجو برای: bipartite l

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

2010
N. Subramanian U. K. Misra

The precise form of tensorial transformations acting on a given collection of infinite matrices into another ; for such classical ideas connected with the summability field of double gai sequence spaces. In this paper the results are impose conditions on the tensor g so that it becomes a tensorial transformations from the metric space χ to the metric space C Keywords—tensorial transformations,d...

Journal: :Australasian J. Combinatorics 2011
R. Sampathkumar M. Simaringa

Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for al...

Journal: :IJCSE 2006
Weng-Long Chang Michael Ho Minyi Guo Chengfei Liu

In the paper, it is demonstrated how to apply sticker in the sticker-based model for constructing solution space of DNA for the setbasis problem and how to apply DNA operations in the Adleman-Lipton model to solve that problem from solution space of sticker. Furthermore, this work shows the ability of DNA-based computing for resolving the NP-complete problems.

Journal: :Acta Mathematicae Applicatae Sinica 2021

Let G be a simple connected graph with order n. $$\mathcal{L}(G)$$ and $$\mathcal{Q}(G)$$ the normalized Laplacian signless matrices of G, respectively. λk(G) k-th smallest eigenvalue G. Denote by ρ(A) spectral radius matrix A. In this paper, we study behaviors λ2(G) $$\rho(\mathcal{L}(G))$$ when is perturbed three operations. We also properties X for bipartite graphs, where unit eigenvector co...

1997
Christos Kaklamanis Giuseppe Persiano Thomas Erlebach Klaus Jansen

Motivated by the problem of eecient routing in all-optical networks, we study a constrained version of the bipartite edge coloring problem. We show that if the edges adjacent to a pair of opposite vertices of an L-regular bipartite graph are already colored with L diierent colors, then the rest of the edges can be colored using at most (1+=2)L colors. We also show that this bound is tight by co...

B. Abedi Kiasari, B. Teimourpour Sh. Ghazi Mirsaeed

Ontology is a requirement engineering product and the key to knowledge discovery. It includes the terminology to describe a set of facts, assumptions, and relations with which the detailed meanings of vocabularies among communities can be determined. This is a qualitative content analysis research. This study has made use of ontology for the first time to discover the knowledge of vaccine in Ir...

2017
Uri Andrews Rutger Kuyper Steffen Lempp Mariya Ivanova Soskova Mars M. Yamaleev

In this paper, we show that the so-called “double bubbles” are not downward dense in the d.c.e. degrees. Here, a pair of d.c.e. degrees d1 > d2 > 0 forms a double bubble if all d.c.e. degrees below d1 are comparable with d2.

2005
D. Panja

We study the response of a two-dimensional hexagonal packing of rigid, frictionless spherical grains due to a vertically downward point force on a single grain at the top layer. We use a statistical approach, where each configuration of the contact forces is equally likely. We find that the response is double-peaked, independantly of the details of boundary conditions. The two peaks lie precise...

Journal: :Discussiones Mathematicae Graph Theory 2019

Journal: :The Electronic Journal of Combinatorics 2012

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

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