AbstractLet 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)
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
AbstractThe strong chromatic index s′(G) is the minimum integer t such that there is an edge-colorin...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
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 T(2k) be the set of all tricyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractLet G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perf...
AbstractA bipartite graph G=(A,B) is said to have positive surplus (as viewed from A) if the number ...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractLet H(n, e) denote the set of all connected graphs having n vertices and e edges. The graphs...
AbstractThe index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-kn...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractThe Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
AbstractThe strong chromatic index s′(G) is the minimum integer t such that there is an edge-colorin...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
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 T(2k) be the set of all tricyclic graphs on 2k(k⩾2) vertices with perfect matchings. In ...
AbstractWe identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whos...
AbstractLet G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perf...
AbstractA bipartite graph G=(A,B) is said to have positive surplus (as viewed from A) if the number ...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractLet H(n, e) denote the set of all connected graphs having n vertices and e edges. The graphs...
AbstractThe index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-kn...
AbstractLet U+(2k) be the set of all unicyclic graphs on 2k(k⩾2) vertices with perfect matchings. Le...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractThe Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenv...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
AbstractThe strong chromatic index s′(G) is the minimum integer t such that there is an edge-colorin...
In this BSc thesis we focus on one of the most important topics in combinatorial optimization, known...
DOI
Add to ORKG