Related papers: E-cospectral hypergraphs and some hypergraphs dete…
Given a $k$-uniform hypergraph $G$ with vertex set $[n]$ and edge set $E(G)$, the ABC tensor $\mathcal{ABC}(G)$ of $G$ is the $k$-order $n$-dimensional tensor with \[ \mathcal{ABC}(G)_{i_1, \dots, i_k}= \begin{cases}…
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…
The k-th power of a n-vertex graph X is the iterated cartesian product of X with itself. The k-th symmetric power of X is the quotient graph of certain subgraph of its k-th power by the natural action of the symmetric group. It is natural…
Symbolic ultrametrics define edge-colored complete graphs K_n and yield a simple tree representation of K_n. We discuss, under which conditions this idea can be generalized to find a symbolic ultrametric that, in addition, distinguishes…
Let $G$ be a connected graph with vertex set $V(G)=\{v_{1},v_{2},...,v_{n}\}$. The distance matrix $D(G)=(d_{ij})_{n\times n}$ is the matrix indexed by the vertices of $G,$ where $d_{ij}$ denotes the distance between the vertices $v_{i}$…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…
Here, we define a subdivision operation for a hypergraph and compute all the eigenvalues of the subdivision of regular and certain non-regular hypergraphs. In non-regular hypergraphs, we investigate the power of regular graphs, various…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
Starting with an isolated vertex, here we construct a threshold hypergraph by repeatedly adding an isolated vertex or a $k$-dominating vertex set. We represent a threshold hypergraph by a string of non-negative integers and find the…
The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…
We prove that two horizontal-strip LLT polynomials are equal if the associated weighted graphs defined by the author in a previous paper are isomorphic. This provides a sufficient condition for equality of horizontal-strip LLT polynomials…
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…
For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…
An $r$-uniform supertree is a connected and acyclic hypergraph of which each edge has $r$ vertices, where $r\geq 3$. We propose the concept of matching energy for an $r$-uniform hypergraph, which is defined as the sum of the absolute value…
Let $\varepsilon(G)$ be the eccentricity matrix of a graph $G$ and $Spec(\varepsilon(G))$ be the eccentricity spectrum of $G$. Let $H[G_1,G_2,\ldots, G_k]$ be the $H$-join of graphs $G_1,G_2,\ldots, G_k$ and let $H[G]$ be lexicographic…
Consider a graph $G$ and a $k$-uniform hypergraph $\mathcal{H}$ on common vertex set $[n]$. We say that $\mathcal{H}$ is $G$-intersecting if for every pair of edges in $X,Y \in \mathcal{H}$ there are vertices $x \in X$ and $y \in Y$ such…
In this paper, it is shown that the graph $T_4(p,q,r)$ is determined by its Laplacian spectrum and there are no two non-isomorphic such graphs which are cospectral with respect to adjacency spectrum.
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit label. We define the adjacency, incidence, Kirchoff Laplacian and normalized Laplacian of a complex unit hypergraph and study each of them.…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…