Equivariant Euler characteristics of symplectic buildings

Graphs and Combinatorics

Published On 2022/6

We compute the equivariant Euler characteristics of the buildings for the symplectic groups over finite fields.

Journal

Graphs and Combinatorics

Published On

2022/6

Volume

38

Issue

3

Page

91

Authors

Jesper Møller

Jesper Møller

Aalborg Universitet

Position

Professor in Statistics

H-Index(all)

46

H-Index(since 2020)

23

I-10 Index(all)

0

I-10 Index(since 2020)

0

Citation(all)

0

Citation(since 2020)

0

Cited By

0

Research Interests

Mathematical Statistics

Probability Theory

University Profile Page

Other Articles from authors

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2404.09525

Coupling results and Markovian structures for number representations of continuous random variables

A general setting for nested subdivisions of a bounded real set into intervals defining the digits of a random variable with a probability density function is considered. Under the weak condition that is almost everywhere lower semi-continuous, a coupling between and a non-negative integer-valued random variable is established so that have an interpretation as the ``sufficient digits'', since the distribution of conditioned on does not depend on . Adding a condition about a Markovian structure of the lengths of the intervals in the nested subdivisions, becomes a Markov chain of a certain order . If then are IID with a known distribution. When and the Markov chain is uniformly geometric ergodic, a coupling is established between and a random time so that the chain after time is stationary and follows a simple known distribution. The results are related to several examples of number representations generated by a dynamical system, including base- expansions, generalized L\"uroth series, -expansions, and continued fraction representations. The importance of the results and some suggestions and open problems for future research are discussed.

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2404.08387

The asymptotic distribution of the scaled remainder for pseudo golden ratio expansions of a continuous random variable

Let be the base- expansion of a continuous random variable on the unit interval where is the positive solution to for an integer (i.e., is a generalization of the golden mean for which ). We study the asymptotic distribution and convergence rate of the scaled remainder when tends to infinity.

Jesper Møller

Jesper Møller

Aalborg Universitet

Methodology and Computing in Applied Probability

How many digits are needed?

Let be the digits in the base-q expansion of a random variable X defined on [0, 1) where is an integer. For , we study the probability distribution of the (scaled) remainder : If X has an absolutely continuous CDF then converges in the total variation metric to the Lebesgue measure on the unit interval. Under weak smoothness conditions we establish first a coupling between X and a non-negative integer valued random variable N so that follows and is independent of , and second exponentially fast convergence of and its PDF . We discuss how many digits are needed and show examples of our results.

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2312.09652

The asymptotic distribution of the remainder in a certain base- expansion

Let be the base- expansion of a continuous random variable on the unit interval where is the golden ratio. We study the asymptotic distribution and convergence rate of the scaled remainder when tends to infinity.

2023/12/15

Article Details
Jesper Møller

Jesper Møller

Aalborg Universitet

Proceedings of the London Mathematical Society

Realizability and tameness of fusion systems

A saturated fusion system over a finite p$p$‐group S$S$ is a category whose objects are the subgroups of S$S$ and whose morphisms are injective homomorphisms between the subgroups satisfying certain axioms. A fusion system over S$S$ is realized by a finite group G$G$ if S$S$ is a Sylow p$p$‐subgroup of G$G$ and morphisms in the category are those induced by conjugation in G$G$. One recurrent question in this subject is to find criteria as to whether a given saturated fusion system is realizable or not. One main result in this paper is that a saturated fusion system is realizable if all of its components (in the sense of Aschbacher) are realizable. Another result is that all realizable fusion systems are tame: a finer condition on realizable fusion systems that involves describing automorphisms of a fusion system in terms of those of some group that realizes it. Stated in this way, these results depend on the …

Jesper Møller

Jesper Møller

Aalborg Universitet

ACM Transactions on Spatial Algorithms and Systems

Stochastic Routing with Arrival Windows

Arriving at a destination within a specific time window is important in many transportation settings. For example, trucks may be penalized for early or late arrivals at compact terminals, and early and late arrivals at general practitioners, dentists, and so on, are also discouraged, in part due to COVID. We propose foundations for routing with arrival-window constraints. In a setting where the travel time of a road segment is modeled by a probability distribution, we define two problems where the aim is to find a route from a source to a destination that optimizes or yields a high probability of arriving within a time window while departing as late as possible. In this setting, a core challenge is to enable comparison between paths that may potentially be part of a result path with the goal of determining whether a path is uninteresting and can be disregarded given the existence of another path. We show that existing solutions …

2023/11/21

Article Details
Jesper Møller

Jesper Møller

Aalborg Universitet

Spatial Statistics

Fitting the grain orientation distribution of a polycrystalline material conditioned on a Laguerre tessellation

The description of distributions related to grain microstructure helps physicists to understand the processes in materials and their properties. This paper presents a general statistical methodology for the analysis of crystallographic orientations of grains in a 3D Laguerre tessellation dataset which represents the microstructure of a polycrystalline material. We introduce complex stochastic models which may substitute expensive laboratory experiments: conditional on the Laguerre tessellation, we suggest interaction models for the distribution of cubic crystal lattice orientations, where the interaction is between pairs of orientations for neighbouring grains in the tessellation. We discuss parameter estimation and model comparison methods based on maximum pseudolikelihood as well as graphical procedures for model checking using simulations. Our methodology is applied for analysing a dataset representing a nickel …

Jesper Møller

Jesper Møller

Aalborg Universitet

Methodology and Computing in Applied Probability

Singular distribution functions for random variables with stationary digits

Let F be the cumulative distribution function (CDF) of the base-q expansion , where is an integer and is a stationary stochastic process with state space . In a previous paper we characterized the absolutely continuous and the discrete components of F. In this paper we study special cases of models, including stationary Markov chains of any order and stationary renewal point processes, where we establish a law of pure types: F is then either a uniform or a singular CDF on [0, 1]. Moreover, we study mixtures of such models. In most cases expressions and plots of F are given.

Jesper Møller

Jesper Møller

Aalborg Universitet

arXiv preprint arXiv:2212.08402

Cox processes driven by transformed Gaussian processes on linear networks

There is a lack of point process models on linear networks. For an arbitrary linear network, we use isotropic covariance functions with respect to the geodesic metric or the resistance metric to construct new models for isotropic Gaussian processes and hence new models for various Cox processes with isotropic pair correlation functions. In particular we introduce three model classes given by log Gaussian, interrupted, and permanental Cox processes on linear networks, and consider for the first time statistical procedures and applications for parametric families of such models. Moreover, we construct new simulation algorithms for Gaussian processes on linear networks and discuss whether the geodesic metric or the resistance metric should be used for the kind of Cox processes studied in this paper.

2022/12/16

Article Details
Jesper Møller

Jesper Møller

Aalborg Universitet

International Statistical Review

Should we condition on the number of points when modelling spatial point patterns?

We discuss the practice of directly or indirectly assuming a model for the number of points when modelling spatial point patterns even though it is rarely possible to validate such a model in practice because most point pattern data consist of only one pattern. We therefore explore the possibility to condition on the number of points instead when fitting and validating spatial point process models. In a simulation study with different popular spatial point process models, we consider model validation using global envelope tests based on functional summary statistics. We find that conditioning on the number of points will for some functional summary statistics lead to more narrow envelopes and thus stronger tests and that it can also be useful for correcting for some conservativeness in the tests when testing composite hypothesis. However, for other functional summary statistics, it makes little or no difference to condition …

Jesper Møller

Jesper Møller

Aalborg Universitet

Journal of Applied Probability

Characterization of random variables with stationary digits

Let be an integer, a stochastic process with state space , and F the cumulative distribution function (CDF) of . We show that stationarity of is equivalent to a functional equation obeyed by F, and use this to characterize the characteristic function of X and the structure of F in terms of its Lebesgue decomposition. More precisely, while the absolutely continuous component of F can only be the uniform distribution on the unit interval, its discrete component can only be a countable convex combination of certain explicitly computable CDFs for probability distributions with finite support. We also show that is a Rajchman measure if and only if F is the uniform CDF on [0, 1].

Jesper Møller

Jesper Møller

Aalborg Universitet

Spatial Statistics

Fitting three-dimensional Laguerre tessellations by hierarchical marked point process models

We present a general statistical methodology for analysing a Laguerre tessellation data set viewed as a realization of a marked point process model. In the first step, for the points, we use a nested sequence of multiscale processes which constitute a flexible parametric class of pairwise interaction point process models. In the second step, for the marks/radii conditioned on the points, we consider various exponential family models where the canonical sufficient statistic is based on tessellation characteristics. For each step, parameter estimation based on maximum pseudolikelihood methods is tractable. For model selection, we consider maximized log pseudolikelihood functions for models of the radii conditioned on the points. Model checking is performed using global envelopes and corresponding tests in both steps and moreover by comparing observed and simulated tessellation characteristics in the second step …

Jesper Møller

Jesper Møller

Aalborg Universitet

Translational psychiatry

Layer III pyramidal cells in the prefrontal cortex reveal morphological changes in subjects with depression, schizophrenia, and suicide

Brodmann Area 46 (BA46) has long been regarded as a hotspot of disease pathology in individuals with schizophrenia (SCH) and major depressive disorder (MDD). Pyramidal neurons in layer III of the Brodmann Area 46 (BA46) project to other cortical regions and play a fundamental role in corticocortical and thalamocortical circuits. The AutoCUTS-LM pipeline was used to study the 3-dimensional structural morphology and spatial organization of pyramidal cells. Using quantitative light microscopy, we used stereology to calculate the entire volume of layer III in BA46 and the total number and density of pyramidal cells. Volume tensors estimated by the planar rotator quantified the volume, shape, and nucleus displacement of pyramidal cells. All of these assessments were carried out in four groups of subjects: controls (C, n = 10), SCH (n = 10), MDD (n = 8), and suicide subjects with a history of depression (SU …

Jesper Møller

Jesper Møller

Aalborg Universitet

Graphs and Combinatorics

Equivariant Euler characteristics of symplectic buildings

We compute the equivariant Euler characteristics of the buildings for the symplectic groups over finite fields.

Jesper Møller

Jesper Møller

Aalborg Universitet

Journal of Computational and Graphical Statistics

MCMC computations for Bayesian mixture models using repulsive point processes

Repulsive mixture models have recently gained popularity for Bayesian cluster detection. Compared to more traditional mixture models, repulsive mixture models produce a smaller number of well-separated clusters. The most commonly used methods for posterior inference either require to fix a priori the number of components or are based on reversible jump MCMC computation. We present a general framework for mixture models, when the prior of the “cluster centers” is a finite repulsive point process depending on a hyperparameter, specified by a density which may depend on an intractable normalizing constant. By investigating the posterior characterization of this class of mixture models, we derive a MCMC algorithm which avoids the well-known difficulties associated to reversible jump MCMC computation. In particular, we use an ancillary variable method, which eliminates the problem of having intractable …

Jesper Møller

Jesper Møller

Aalborg Universitet

Scandinavian Journal of Statistics

Approximate Bayesian inference for a spatial point process model exhibiting regularity and random aggregation

In this article, we propose a doubly stochastic spatial point process model with both aggregation and repulsion. This model combines the ideas behind Strauss processes and log Gaussian Cox processes. The likelihood for this model is not expressible in closed form but it is easy to simulate realizations under the model. We therefore explain how to use approximate Bayesian computation (ABC) to carry out statistical inference for this model. We suggest a method for model validation based on posterior predictions and global envelopes. We illustrate the ABC procedure and model validation approach using both simulated point patterns and a real data example.

Jesper Møller

Jesper Møller

Aalborg Universitet

Journal of Algebraic Combinatorics

Equivariant Euler characteristics of unitary buildings

The (p-primary) equivariant Euler characteristics of the buildings for the general unitary groups over finite fields are determined.

Jesper Møller

Jesper Møller

Aalborg Universitet

Communications Biology

Cellular 3D-reconstruction and analysis in the human cerebral cortex using automatic serial sections

Techniques involving three-dimensional (3D) tissue structure reconstruction and analysis provide a better understanding of changes in molecules and function. We have developed AutoCUTS-LM, an automated system that allows the latest advances in 3D tissue reconstruction and cellular analysis developments using light microscopy on various tissues, including archived tissue. The workflow in this paper involved advanced tissue sampling methods of the human cerebral cortex, an automated serial section collection system, digital tissue library, cell detection using convolution neural network, 3D cell reconstruction, and advanced analysis. Our results demonstrated the detailed structure of pyramidal cells (number, volume, diameter, sphericity and orientation) and their 3D spatial organization are arranged in a columnar structure. The pipeline of these combined techniques provides a detailed analysis of tissues …

Jesper Møller

Jesper Møller

Aalborg Universitet

AMERICAN MATHEMATICAL SOCIETY

THE NUMBER OF p-ELEMENTS IN FINITE GROUPS OF LIE TYPE OF CHARACTERISTIC p

The combinatorics of the poset of p-radical p-subgroups of a finite group is used to count the number of p-elements.

Other articles from Graphs and Combinatorics journal

Zoltán  Lóránt Nagy

Zoltán Lóránt Nagy

Eötvös Loránd Tudományegyetem

Graphs and Combinatorics

A note on internal partitions: the 5-regular case and beyond

An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the other one. It has been shown that apart from finitely many counterexamples, every 3, 4 or 6-regular graph has an internal partition. In this note we focus on the 5-regular case and show that among the subgraphs of minimum degree at least 3 of 5-regular graphs, there are some which have small intersection. We also discuss the existence of internal partitions in some families of Cayley graphs, notably we determine all 5-regular Abelian Cayley graphs which do not have an internal partition.

Vaidy Sivaraman

Vaidy Sivaraman

Mississippi State University

Graphs and Combinatorics

Signed Ramsey Numbers

Let r (s, t) be the classical 2-color Ramsey number; that is, the smallest integer n such that any edge 2-colored contains either a monochromatic of color 1 or of color 2. Define the signed Ramsey number to be the smallest integer n for which any signing of has a subgraph which switches to or. We prove the following results.

Dillon Mayhew

Dillon Mayhew

Victoria University of Wellington

Graphs and Combinatorics

Reduced clique graphs: a correction to “Chordal graphs and their clique graphs”

Galinier, Habib, and Paul introduced the reduced clique graph of a chordal graph G. The nodes of the reduced clique graph are the maximal cliques of G, and two nodes are joined by an edge if and only if they form a non-disjoint separating pair of cliques in G. In this case the weight of the edge is the size of the intersection of the two cliques. A clique tree of G is a tree with the maximal cliques of G as its nodes, where for any , the subgraph induced by the nodes containing v is connected. Galinier et al. prove that a spanning tree of the reduced clique graph is a clique tree if and only if it has maximum weight, but their proof contains an error. We explain and correct this error. In addition, we initiate a study of the structure of reduced clique graphs by proving that they cannot contain any induced cycle of length five (although they may contain induced cycles of length three or any even integer greater than two). We …

Sogol Jahanbekam

Sogol Jahanbekam

University of Colorado Denver

Graphs and Combinatorics

Weak Dynamic Coloring of Planar Graphs

The k-weak-dynamic number of a graph G is the smallest number of colors we need to color the vertices of G in such a way that each vertex v of degree d(v) sees at least min colors on its neighborhood. We use reducible configurations and list coloring of graphs to prove that all planar graphs have 3-weak-dynamic number at most 6.

Chinh T. Hoang

Chinh T. Hoang

Wilfrid Laurier University

Graphs and Combinatorics

Infinite Families of k-Vertex-Critical (, )-Free Graphs

A graph is k-vertex-critical if but for all . We construct new infinite families of k-vertex-critical -free graphs for all . Our construction generalises known constructions for 4-vertex-critical -free graphs and 5-vertex-critical -free graphs and is in contrast to the fact that there are only finitely many 5-vertex-critical -free graphs. In fact, our construction is even more well-structured, being -free.

Jorge Urrutia

Jorge Urrutia

Universidad Nacional Autónoma de México

Graphs and Combinatorics

Crossing and intersecting families of geometric graphs on point sets

Let S be a set of n points in the plane in general position. Two line segments connecting pairs of points of S cross if they have an interior point in common. Two vertex-disjoint geometric graphs with vertices in S cross if there are two edges, one from each graph, which cross. A set of vertex-disjoint geometric graphs with vertices in S is called mutually crossing if any two of them cross. We show that there exists a constant c such that from any family of n mutually-crossing triangles, one can always obtain a family of at least mutually-crossing 2-paths (each of which is the result of deleting an edge from one of the triangles) and provide an example that implies that c cannot be taken to be larger than 2/3. Then, for every n we determine the maximum number of crossings that a Hamiltonian cycle on a set of n points might have, and give examples achieving this bound. Next, we construct a point set whose longest perfect matching …

Geir Dahl

Geir Dahl

Universitetet i Oslo

Graphs and Combinatorics

Multipermutations and Stirling Multipermutations

We consider multipermutations and a certain partial order, the weak Bruhat order, on this set. This generalizes the Bruhat order for permutations, and is defined in terms of containment of inversions. Different characterizations of this order are given. We also study special multipermutations called Stirling multipermutations and their properties.

Alex Scott

Alex Scott

University of Oxford

Graphs and Combinatorics

A Note on the Gyárfás–Sumner Conjecture

The Gyárfás–Sumner conjecture says that for every tree T and every integer , if G is a graph with no clique of size t and with sufficiently large chromatic number, then G contains an induced subgraph isomorphic to T. This remains open, but we prove that under the same hypotheses, G contains a subgraph H isomorphic to T that is “path-induced”; that is, for some distinguished vertex r, every path of H with one end r is an induced path of G.

Danila Cherkashin

Danila Cherkashin

Moscow Institute of Physics and Technology

Graphs and Combinatorics

Erdős–Hajnal Problem for H-Free Hypergraphs

This paper deals with the minimum number of edges in an H-free hypergraph with the chromatic number more than r. We show how bounds on Ramsey and Turán numbers imply bounds on.

Shaun Fallat

Shaun Fallat

University of Regina

Graphs and Combinatorics

The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions

The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently the class of graphs in which all associated symmetric matrices possess the Strong Spectral Property (denoted) were studied, and along these lines we aim to study properties of graphs that exhibit a so-called barbell partition. Such a partition is a known impediment to membership in the class. In particular we consider the existence of barbell partitions under various standard and useful graph operations. We do so by considering both the preservation of an already present barbell partition after performing said graph operations as well as barbell partitions which are introduced under certain graph operations. The specific graph operations we consider are the addition and removal of vertices and edges, the duplication of vertices, as …

Valentino Vito

Valentino Vito

Universitas Indonesia

Graphs and Combinatorics

Infinite Ramsey-minimal graphs for star forests

For graphs F, G, and H, we write if every red-blue coloring of the edges of F produces a red copy of G or a blue copy of H. The graph F is said to be (G, H)-minimal if it is subgraph-minimal with respect to this property. The characterization problem for Ramsey-minimal graphs is classically done for finite graphs. In 2021, Barrett and the second author generalized this problem to infinite graphs. They asked which pairs (G, H) admit a Ramsey-minimal graph and which ones do not. We show that any pair of star forests such that at least one of them involves an infinite-star component admits no Ramsey-minimal graph. Also, we construct a Ramsey-minimal graph for a finite star forest versus a subdivision graph. This paper builds upon the results of Burr et al. (Discrete Math 33:227–237, 1981) on Ramsey-minimal graphs for finite star forests.

Zsolt Tuza

Zsolt Tuza

Pannon Egyetem

Graphs and Combinatorics

Extremal graph theoretic questions for q-ary vectors

A q-graph H on n vertices is a set of vectors of length n with all entries from and every vector (that we call a q-edge) having exactly two non-zero entries. The support of a q-edge is the pair of indices of non-zero entries. We say that H is an s-copy of an ordinary graph F if , F is isomorphic to the graph with edge set , and whenever , the entries with index corresponding to v in the q-edges corresponding to e and sum up to at least s. E.g., the q-edges (1, 3, 0, 0, 0), (0, 1, 0, 0, 3), and (3, 0, 0, 0, 1) form a 4-triangle. The Turán number is the maximum number of q-edges that a q-graph H on n vertices can have if it does not contain any s-copies of F. In the present paper, we determine the asymptotics of for many graphs F.

Dean Crnković

Dean Crnković

Sveucilište u Rijeci

Graphs and combinatorics

Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs

In this paper, we give constructions of self-orthogonal codes from orbit matrices of Deza graphs, normally regular digraphs and Deza digraphs in terms of a definition given by Wang and Feng. These constructions can also be applied to adjacency matrices of the mentioned graphs. Since a lot of constructions of Deza graphs, normally regular digraphs and Deza digraphs in the sense of Wang and Feng have been known, the methods presented in this paper give us a rich source of matrices that span self-orthogonal codes.

Dr.  Peng LI (李朋)

Dr. Peng LI (李朋)

Lanzhou University

Graphs and Combinatorics

Using Euler’s Formula to Find the Lower Bound of the Page Number

The concept of book embedding, originating in computer science, has found extensive applications in various problem domains. A book embedding of a graph G involves arranging the vertices of G in an order along a line and assigning the edges to one or more half-planes. The page number of a graph is the smallest possible number of half-planes for any book embedding of the graph. Determining the page number is a key aspect of book embedding and carries significant importance. This paper aims to investigate the non-trivial lower bound of the page number for both a graph G and a random graph by incorporating two seemingly unrelated concepts: edge-arboricity and Euler’s Formula. Our analysis reveals that for a graph G, which is not a path,, where denotes the edge-arboricity of G, and for an outerplanar graph, the lower bound is optimal. For, …

Fernando Esteban Contreras Mendoza

Fernando Esteban Contreras Mendoza

Universidad Nacional Autónoma de México

Graphs and Combinatorics

Minimal obstructions for polarity, monopolarity, unipolarity and (s, 1)-polarity in generalizations of cographs

It is known that every hereditary property can be characterized by finitely many minimal obstructions when restricted to either the class of cographs or the class of-reducible graphs. In this work, we prove that the same is true when restricted to some other superclasses of cographs, including-sparse and-extendible graphs (both of which extend-reducible graphs). We also present complete lists of-sparse and-extendible minimal obstructions for polarity, monopolarity, unipolarity, and (s, 1)-polarity, where s is a positive integer. In parallel to the case of-reducible graphs, all the-sparse minimal obstructions for these hereditary properties are cographs.

Hervé Hocquard

Hervé Hocquard

Université de Bordeaux

Graphs and Combinatorics

On inducing degenerate sums through 2-labellings

We deal with a variant of the 1–2–3 Conjecture introduced by Gao, Wang, and Wu (Graphs Combin 32: 1415–1421, 2016). This variant asks whether all graphs can have their edges labelled with 1 and 2 so that when computing the sums of labels incident to the vertices, no monochromatic cycle appears. In the aforementioned seminal work, the authors mainly verified their conjecture for a few classes of graphs, namely graphs with maximum average degree at most 3 and series–parallel graphs, and observed that it also holds for simple classes of graphs (cycles, complete graphs, and complete bipartite graphs). In this work, we provide a deeper study of this conjecture, establishing strong connections with other, more or less distant notions of graph theory. While this conjecture connects quite naturally to other notions and problems surrounding the 1–2–3 Conjecture, it can also be expressed so that it relates to notions …

Andrea Švob

Andrea Švob

Sveucilište u Rijeci

Graphs and combinatorics

Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs

In this paper, we give constructions of self-orthogonal codes from orbit matrices of Deza graphs, normally regular digraphs and Deza digraphs in terms of a definition given by Wang and Feng. These constructions can also be applied to adjacency matrices of the mentioned graphs. Since a lot of constructions of Deza graphs, normally regular digraphs and Deza digraphs in the sense of Wang and Feng have been known, the methods presented in this paper give us a rich source of matrices that span self-orthogonal codes.

Zi-Xia Song

Zi-Xia Song

University of Central Florida

Graphs and Combinatorics

Planar Turán numbers of cubic graphs and disjoint union of cycles

The planar Turán number of a graph H, denoted by , is the maximum number of edges in a planar graph on n vertices without containing H as a subgraph. This notion was introduced by Dowden in 2016 and has attracted quite some attention since then; those work mainly focus on finding when H is a cycle or Theta graph or H has maximum degree at least four. In this paper, we first completely determine the exact values of when H is a cubic graph. We then prove that for all , and obtain the lower bounds of for all . Finally, we also completely determine the exact values of for all and .

Shahla Nasserasr

Shahla Nasserasr

Rochester Institute of Technology

Graphs and Combinatorics

The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions

The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently the class of graphs in which all associated symmetric matrices possess the Strong Spectral Property (denoted) were studied, and along these lines we aim to study properties of graphs that exhibit a so-called barbell partition. Such a partition is a known impediment to membership in the class. In particular we consider the existence of barbell partitions under various standard and useful graph operations. We do so by considering both the preservation of an already present barbell partition after performing said graph operations as well as barbell partitions which are introduced under certain graph operations. The specific graph operations we consider are the addition and removal of vertices and edges, the duplication of vertices, as …

Cesar Hernández-Cruz

Cesar Hernández-Cruz

Universidad Nacional Autónoma de México

Graphs and Combinatorics

Minimal obstructions for polarity, monopolarity, unipolarity and (s, 1)-polarity in generalizations of cographs

It is known that every hereditary property can be characterized by finitely many minimal obstructions when restricted to either the class of cographs or the class of-reducible graphs. In this work, we prove that the same is true when restricted to some other superclasses of cographs, including-sparse and-extendible graphs (both of which extend-reducible graphs). We also present complete lists of-sparse and-extendible minimal obstructions for polarity, monopolarity, unipolarity, and (s, 1)-polarity, where s is a positive integer. In parallel to the case of-reducible graphs, all the-sparse minimal obstructions for these hereditary properties are cographs.