Results 151 to 160 of about 615,797 (257)
Graph isomorphism and multivariate graph spectrum
Advances in Applied MathematicsWe provide a criterion to distinguish two graphs which are indistinguishable by $2$-dimensional Weisfeiler-Lehman algorithm for almost all graphs. Haemers conjectured that almost all graphs are identified by their spectrum. Our approach suggests that almost all graphs are identified by their generalized block Laplacian spectrum.
Wei Wang 0195, Da Zhao
openaire +3 more sources
Vague Mereology and Borderline Connections
Philosophy and Phenomenological Research, EarlyView.ABSTRACT The summit of Mt Everest is determinately part of it; parts of the Khumbu Glacier are determinately not. In between are a range of candidate parts whose mereological status with respect to Mt Everest is unsettled. Among the various accounts of vagueness, supervaluationism has received a great deal of attention.
A. J. Cotnoir, Giulia Schirripa
wiley +1 more source
GRAPH SPECTRA AND ISOMORPHISM TESTING
, 1983 The graph isomorphism problem has been heavily researched in the last decade. Recently, approaches from topology and group theory have resulted polynomial time isomorphism tests for graphs of bounded genus and graphs of bounded valence. In this thesis we
MOUNT, DAVID MARK
core +1 more source
On the Limits of Intransitive Coordination
Ratio, EarlyView.ABSTRACT A growing number of authors suggest that concept coordination—the kind of relation we pick out when we say that the concepts of one or more individuals represent something as the same—is not a transitive relation. Here we consider global features of representational systems to break new ground in the assessment of the intransitivity view. From
Víctor M. Verdejo, Joost J. Joosten
wiley +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, Volume 113, Issue 4, Page 663-676, December 2026.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Isomorphism classes of concrete graph coverings
, 2019 Hofmeister introduced the notion of a concrete (resp., concrete regular) covering of a graph G and gave formulas for enumerating the isomorphism classes of concrete (resp., concrete regular) coverings of G [Ars Combin., 32 (1991), pp.
Kim, J, Kwak, JH, Lee, J, Feng, RQ
core +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
Graph isomorphism detection program
, 1993 This thesis mainly revolves around the topic of graph isomorphism. A computer program is developed to determine whether the two graphs given by the user are isomorphic or not.
Torres, Emmanuel Ronald
core
Parameterized complexity of graph isomorphism testing
We survey recent developments in the parameterized complexity of the graph isomorphism problem. Our focus lies on the fixed-parameter tractability of isomorphism testing for various graph parameters.
Neuen, Daniel
core +1 more source
On the additive image of zeroth persistent homology
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source