中文
相关论文

相关论文: Non-Geometric Cospectral Mates of Line Graphs with…

200 篇论文

Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. We prove that the switching equivalence class of the gain function on the line…

组合数学 · 数学 2021-01-19 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno

The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…

离散数学 · 计算机科学 2023-10-06 Flavia Bonomo-Braberman , Gastón Abel Brito

Haemers conjectures that almost all graphs are determined by their spectra. Suppose $G \sim \mathcal{G}(n, p)$ is a random graph with each edge chosen independently with probability $p$ with $0 < p < 1$. Then $$\Pr(G \text{ is not…

组合数学 · 数学 2025-09-09 Wei Wang , Da Zhao

Let $\Gamma=(G,\sigma)$ be a signed graph, where $\sigma$ is the sign function on the edges of $G$. In this paper, we use the operation of partial transpose to obtain non-isomorphic Laplacian cospectral signed graphs. We will introduce two…

组合数学 · 数学 2022-05-19 Tahir Shamsher , S. Pirzada , Mushtaq A. Bhat

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

组合数学 · 数学 2016-10-26 Huda Chuangpishit , Jeannette Janssen

Graph neural networks (GNNs) are a class of neural networks that allow to efficiently perform inference on data that is associated to a graph structure, such as, e.g., citation networks or knowledge graphs. While several variants of GNNs…

神经与进化计算 · 计算机科学 2018-02-27 Simone Scardapane , Steven Van Vaerenbergh , Danilo Comminiello , Aurelio Uncini

Given a finite vector space $V=\mathbb{F}_q^n$, the $q$-analogue of a graph, called a $q$-graph, is a pair $\Gamma=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of $1$-dimensional subspaces of $V$ and $\mathcal{E}$ is a subset…

组合数学 · 数学 2026-01-30 Daniel R Hawtin , Padraig Ó Catháin

Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…

计算机视觉与模式识别 · 计算机科学 2011-07-14 Rocio Gonzalez-Diaz , Adrian Ion , Mabel Iglesias-Ham , Walter G. Kropatsch

We study two global structural properties of a graph $\Gamma$, denoted AS and CFS, which arise in a natural way from geometric group theory. We study these properties in the Erd\"os--R\'enyi random graph model G(n,p), proving a sharp…

概率论 · 数学 2020-01-29 Jason Behrstock , Victor Falgas-Ravry , Mark F. Hagen , Timothy Susse

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…

谱理论 · 数学 2008-01-16 Alfredo Alzaga , Rodrigo Iglesias , Ricardo Pignol

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

组合数学 · 数学 2022-07-29 Alvaro Carbonero

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

组合数学 · 数学 2023-03-02 Daniel R. Hawtin , Jin-Xin Zhou , Cheryl E. Praeger

We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.

组合数学 · 数学 2023-05-29 Aida Abiad , Jozefien D'haeseleer , Willem H. Haemers , Robin Simoens

The graph $G$ is said to be strongly regular with parameters $(n,k,\lambda,\mu)$ if the following conditions hold: (1) each vertex has $k$ neighbours; (2) any two adjacent vertices of $G$ have $\lambda$ common neighbours; (3) any two…

组合数学 · 数学 2021-10-06 Jeepamol J Palathingal , Aparna Lakshmanan S , Greg Markowsky

It is well known that the spectrum and the Smith normal form of a matrix can be computed in polynomial time. Thus, it is interesting to explore how good are these parameters for distinguishing graphs. This is relevant since it is related to…

组合数学 · 数学 2023-09-28 Carlos A. Alfaro , Ralihe R. Villagrán , Octavio Zapata

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

组合数学 · 数学 2023-04-27 Agelos Georgakopoulos , Alex Wendland

Let $Q^{+}(2n-1,2)$ be a non-degenerate hyperbolic quadric of $PG(2n-1,2)$. Let $NO^{+}(2n,2)$ be the tangent graph, whose vertices are the points of $PG(2n-1,2) \setminus Q^{+}(2n-1,2)$ and two vertices $u,~v$ are adjacent if the line…

组合数学 · 数学 2023-11-17 Federico Romaniello , Valentino Smaldore

We present a theoretical framework for nonlinear optics of graphene and other 2D materials in layered structures. We derive a key equation to find the effective electric field and the sheet current density in the 2D material for given…

光学 · 物理学 2018-12-27 J. L. Cheng , J. E. Sipe , N. Vermeulen , C. Guo

Consider vector space over non-commutative division algebra. Set of automorphisms of this vector space is group $GL$. Group $GL$ acts on the set of bases of vector space (basis manifold) single transitive and generates active…

综合数学 · 数学 2023-06-02 Aleks Kleyn

This article studies the recovery of graphons when they are convolution kernels on compact (symmetric) metric spaces. This case is of particular interest since it covers the situation where the probability of an edge depends only on some…

统计理论 · 数学 2020-04-08 Yohann De Castro , Claire Lacour , Thanh Mai Pham Ngoc