For every graph pair (G 1, G 2) of the same order and size, there exists a polynomial invariant weight function such that, for non-isomorphic G 1 and G 2, the instances QAP(G 1, G 2), QAP(G 1, G 1) ...

This project allows users to dynamically create and plot polynomial functions of varying degrees with user-defined coefficients and intercepts. The graph shows the polynomial curve along with the ...

Figure 1 Graph for Cos(θ) The above-given graph is for y = cos(θ). This function can be converted to a Maclaurin Series by following certain rules. To resemble the same graph for a series, we must ...

Let be an n-tuple on positive integers then the thorn graph of the parent graph G on n vertices is formed by attaching p i (), new vertices of degree one to each vertex v i of G. Various topological ...

Polynomial-time isomorphism tests are known for many natural classes of graphs including the class of planar graphs, 9 classes of graphs embeddable in a fixed surface 4, 16 and more generally classes ...

The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum ...

In this paper we deal a classical problem, degree restricted spanning trees for series-parallel graph. Our general goal is to prove the NP-completeness of restricted degree spanning trees for ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Let be an n-tuple on positive integers then the thorn graph of the parent graph G on n vertices is formed by attaching p i (), new vertices of degree one to each vertex v i of G. Various topological ...