نتایج جستجو برای: bicyclic graphs
تعداد نتایج: 99205 فیلتر نتایج به سال:
A simple graph is said to be reflexive if its second largest eigenvalue does not exceed 2. The property λ2 ≤ 2 is a hereditary one, i.e. any induced subgraph of a reflexive graph preserves this property and that is why reflexive graphs are usually represented by maximal graphs within a given class. Bicyclic graphs whose two cycles have a common path are called θ-graphs. We consider classes of m...
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
Let G be a graph with n(G) vertices and m(G) be its matching number. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero of adjacency matrix of G. It is well known that if G is a tree, then η(G) = n(G)− 2m(G). Guo et al. [Jiming GUO, Weigen YAN, Yeongnan YEH. On the nullity and the matching number of unicyclic graphs. Linear Alg. Appl., 2009, 431: 1293–1301] proved tha...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید