Download PDF Join the Discussion View in the ACM Digital Library EXAMPLE 2. A standard way of representing graphs is by their adjacency matrices; once we have an adjacency matrix we can obtain a {0, 1 ...
Department of Mathematics, Faculty of Science, University of Jeddah, Jeddah, Saudi Arabia. Representing a graph by using a polynomial is one of the algebraic representations of a graph to study some ...
The eccentric connectivity index based on degree and eccentricity of the vertices of a graph is a widely used graph invariant in mathematics. In this paper we present the explicit generalized ...
This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book ...
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 ...
The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton ...
Abstract: Although graph structures have proved useful in high level vision for object recognition and matching, they can prove computationally cumbersome because of the need to establish reliable ...
Abstract: In digital signal processing, a shift-invariant filter can be represented as a polynomial expansion of a shift operation, that is, the Z-transform representation. When extended to graph ...
Deep Neural Networks are ubiquitous for solving Natural Language Processing and Computer Vision tasks, and are revered as being able to solve any problem given the right model. There has been a clash ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback