2 papers
math.CO2024
Degree Deviation and Spectral Radius
Dieter Rautenbach, Florian Werner
For a finite, simple, and undirected graph with vertices, edges, and largest eigenvalue , Nikiforov introduced the degree deviation of as $s=\sum_{u\in V(G)}\lef…
cs.DM2024
Complexity of Deciding the Equality of Matching Numbers
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +4
A matching is said to be disconnected if the saturated vertices induce a disconnected subgraph and induced if the saturated vertices induce a 1-regular graph. The disconnected and…