Add to ORKGLet B + (2k) be the set of all bicyclic 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 maximal index in B + (2k)
Given a graph $G(V, E)$, finding a small subset of $V$ hitting all maximal bicliques of $G$ is a dif...
AbstractLet m(G) denote the number of vertices covered by a maximum matching in a graph G. We introd...
The sum-connectivity index is a new variant of the famous Randic connectivity index usable in quanti...
AbstractLet B+(2k) be the set of all bicyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
AbstractLet T(2k) be the set of all tricyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
AbstractThis paper describes an algorithm for finding all the perfect matchings in a bipartite graph...
AbstractLet G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perf...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
AbstractWe provide a formula for the number of edges of a maximum induced matching in a graph. As ap...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
AbstractKreweras’ conjecture [G. Kreweras, Matchings and hamiltonian cycles on hypercubes, Bull. Ins...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractA matching of a graph is a near-perfect matching if it covers all but one vertex. A connecte...
A super (d; ffl)-regular graph on 2n vertices is a bipartite graph on the classes of vertices V 1 an...
The second Zagreb index of a graph G is an adjacency-based topological index, which is defined as ?u...
Given a graph $G(V, E)$, finding a small subset of $V$ hitting all maximal bicliques of $G$ is a dif...
AbstractLet m(G) denote the number of vertices covered by a maximum matching in a graph G. We introd...
The sum-connectivity index is a new variant of the famous Randic connectivity index usable in quanti...
AbstractLet B+(2k) be the set of all bicyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
AbstractLet T(2k) be the set of all tricyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
AbstractThis paper describes an algorithm for finding all the perfect matchings in a bipartite graph...
AbstractLet G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perf...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
AbstractWe provide a formula for the number of edges of a maximum induced matching in a graph. As ap...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
AbstractKreweras’ conjecture [G. Kreweras, Matchings and hamiltonian cycles on hypercubes, Bull. Ins...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractA matching of a graph is a near-perfect matching if it covers all but one vertex. A connecte...
A super (d; ffl)-regular graph on 2n vertices is a bipartite graph on the classes of vertices V 1 an...
The second Zagreb index of a graph G is an adjacency-based topological index, which is defined as ?u...
Given a graph $G(V, E)$, finding a small subset of $V$ hitting all maximal bicliques of $G$ is a dif...
AbstractLet m(G) denote the number of vertices covered by a maximum matching in a graph G. We introd...
The sum-connectivity index is a new variant of the famous Randic connectivity index usable in quanti...