نتایج جستجو برای: matching numbers

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

Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...

Journal: :علوم 0

in this paper, by using a new approach on distance between two fuzzy numbers, we construct a new ranking system for fuzzy number which is very realistic and also matching our intuition as the crisp ranking system on r.

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

Journal: :The Electronic Journal of Combinatorics 2006

Journal: : 2022

El yazması eserlerle çalışmak daima zor olmuştur. Onlara ulaşmanın zorluğu bir yana, onlardan yararlanabilmek için de ayrıca uyulması gereken kurallar ve yerine getirilmesi lazım gereklilikler vardır. Eski yazıyı hat stillerini tanımak metni okumak ne kadar lazımsa, onun doğru anlamlı biçimde usulüne göre sayfalandırılması da bilimsel çalışmalarda referans olarak kullanılabilmesinde o derece el...

Journal: :Journal of Combinatorial Theory, Series A 2022

Given a graph G on the vertex set V, non-matching complex of G, denoted by NMk(G), is family subgraphs G??G whose matching number ?(G?) strictly less than k. As an attempt to extend result Linusson, Shareshian and Welker homotopy types NMk(Kn) NMk(Kr,s) arbitrary graphs we show that (i) NMk(G) (3k?3)-Leray, (ii) if bipartite, then (2k?2)-Leray. This obtained analyzing homology links non-empty f...

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

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