AbstractLet T(2k) be the set of all tricyclic graphs on 2k(k⩾2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with the largest index in T(2k)
AbstractA perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/...
In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
AbstractLet B+(2k) be the set of all bicyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
Let B + (2k) be the set of all bicyclic graphs on 2k(k ¿ 2) vertices with perfect matchings. In this...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractIt is well known that the graph invariant, ‘the Merrifield–Simmons index’ is important one i...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the tricyclic ...
AbstractLet G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the pat...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractWe consider two classes of graphs: (i) trees of order n and diameter d=n−3 and (ii) unicycli...
AbstractIn this paper, we show that of all graphs of order n with matching number β, the graphs with...
In this paper, the first and second maximum values of the first and second Zagreb indices of $n-$ver...
Let m be a positive integer and let G be a cubic graph of order 2n. Weconsider the problem of coveri...
AbstractA perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/...
In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
AbstractLet B+(2k) be the set of all bicyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
Let B + (2k) be the set of all bicyclic graphs on 2k(k ¿ 2) vertices with perfect matchings. In this...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractIn this paper, we determine the graph with the largest spectral radius among all the tricycl...
AbstractIt is well known that the graph invariant, ‘the Merrifield–Simmons index’ is important one i...
AbstractIn this paper, we determine graphs with the largest spectral radius among all the tricyclic ...
AbstractLet G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the pat...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractWe consider two classes of graphs: (i) trees of order n and diameter d=n−3 and (ii) unicycli...
AbstractIn this paper, we show that of all graphs of order n with matching number β, the graphs with...
In this paper, the first and second maximum values of the first and second Zagreb indices of $n-$ver...
Let m be a positive integer and let G be a cubic graph of order 2n. Weconsider the problem of coveri...
AbstractA perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/...
In this paper, we prove that the 2-factor polynomial, an invariant of a planar trivalent graph with ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
DOI
Add to ORKG