Related papers: Spectral classes of hypergraphs
When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different…
We generalize the tree-confluent graphs to a broader class of graphs called Delta-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of…
For a projective hypersurface $X \subset \P^n$, the images of the polar maps of degree $k$ are studied. The cohomology class defined by these maps is calculated and classical results on dual varieties are presented as applications.
A general type of ray class fields of global function fields is investigated. The systematic computation of their genera leads to new examples of curves over finite fields with comparatively many rational points.
In this survey paper, we present open problems and conjectures on visibility graphs of points, segments and polygons along with necessary backgrounds for understanding them.
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…
In this paper, we define several measures induced by a finite directed graph. The study themselves is interesting ont only in the noncommutative probability point of view but also in the algebraic structure point of view, since to define…
In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…
This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.
The goal of this paper is to present a centrality measurement for the nodes of a hypergraph, by using existing literature which extends eigenvector centrality from a graph to a hypergraph, and literature which give a general centrality…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
In this paper, we will construct formulas and bounds for Neighborhood Degree-based indices of graphs and describe graphs that attain the bounds. Furthermore, we will establish a lower bound for the spectral radius of any graph.
We prove the generic existence of spectral networks for a large class of spectral data.
Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…
Sampling methods for graph signals in the graph spectral domain are presented. Though conventional sampling of graph signals can be regarded as sampling in the graph vertex domain, it does not have the desired characteristics in regard to…