Scientific Research Publishing

Farrell, E.J. and Guo, J.M. (1993) On the Characterizing Properties of Matching Polynomials. Vishwa International Journal of Graph Theory, 2, 55-62.

ABSTRACT: In the paper, we give a necessary and sufficient condition of matching equivalence of two graphs with the maximum matching root less than or equal to 2.
Scientific Research Publishing

Ma, H.C. and Xia, H. (2001) The Graph with Matching Polynomials Maximum Roots of no Excess 2. Journal of Jilin Institute of Chemical Technology, 18, 67-68. (In Chinese)

ABSTRACT: In the paper, we give a necessary and sufficient condition of matching equivalence of two graphs with the maximum matching root less than or equal to 2.
Bryn Mar Athletics

The Amazing Spider-Graph: With Great Polynomials Comes Great Responsibility

Come meet your friendly neighborhood spider-graph. Because this week at DMC our speaker, Savannah Williams, is teaching us about spider-graphs. About the talk: This talk is based on my undergraduate ...
IEEE

Graph Anomaly Detection With Graph Neural Networks: Current Status and Challenges

Abstract: Graphs are used widely to model complex systems, and detecting anomalies in a graph is an important task in the analysis of complex systems. Graph anomalies are patterns in a graph that do ...
IEEE

Graph manifolds from spectral polynomials

Abstract: Graph structures have proved computationally cumbersome for pattern analysis. The reason for this is that before graphs can be converted to pattern vectors, correspondences must be ...
BBC

Module 7 (M7) - Number and algebra – Graphs

A function is a rule that is applied to one set of values to give another set of values. A function can be illustrated on a graph – points are plotted as coordinates and joined by either a straight ...