English
Related papers

Related papers: Laplacian integrality in P4-sparse and P4-extendib…

200 papers

We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative…

Combinatorics · Mathematics 2011-01-28 Matthias Kriesell

A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$…

Combinatorics · Mathematics 2017-03-13 Pavol Hell , César Hernández-Cruz , Cláudia Linhares Sales

The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and adding a new edge between two new vertices which lie on adjacent edges of $G$. In this…

Combinatorics · Mathematics 2021-08-04 Xiao-Qin Zhang , Shu-Yu Cui , Gui-Xian Tian

Let $G$ be a simple graph. In 1986, Herbert Wilf asked what kind of graphs have an eigenvector with entries formed only by $\pm 1$? In this paper, we answer this question for the adjacency, Laplacian and signless Laplacian matrix of a…

Spectral Theory · Mathematics 2019-09-27 Jorge Alencar , Leonardo de Lima

In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the…

Combinatorics · Mathematics 2026-05-15 Keshav Saini , Anubha Jindal , K. Palpandi

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.

Combinatorics · Mathematics 2010-11-04 Xiaoxia Fan , Yanfeng Luo

Given a graph $G=(V,E)$, a subset $X$ of $V$ is an interval of $G$ provided that for any $a, b\in X$ and $ x\in V \setminus X$, $\{a,x\}\in E$ if and only if $\{b,x\}\in E$. For example, $\emptyset$, $\{x\}(x\in V)$ and $V$ are intervals of…

Combinatorics · Mathematics 2013-08-15 Rim Ben Hamadou , Imed Boudabbous

We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…

Combinatorics · Mathematics 2012-02-15 Edwin R. van Dam , Gholamreza Omidi

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Combinatorics · Mathematics 2025-08-06 Alireza Abdollahi , Majid Arezoomand , Tao Feng , Shixin Wang

The signless Laplacian matrix of a graph $G$ is defined to be the sum of its adjacency matrix and degree diagonal matrix, and its eigenvalues are called $Q$-eigenvalues of $G$. A $Q$-eigenvalue of a graph $G$ is called a $Q$-main eigenvalue…

Combinatorics · Mathematics 2013-04-15 Shuchao Li , Xue Yang

A graph is "$\ell$-holed" if all its induced cycles of length at least four have length exactly $\ell$. We give a complete description of the $\ell$-holed graphs for each $\ell\ge 7$.

Let $\partial^L_1\ge\partial^L_2\ge\cdots\ge\partial^L_n$ be the distance Laplacian eigenvalues of a connected graph $G$ and $m(\partial^L_i)$ the multiplicity of $\partial^L_i$. It is well known that the graphs with $m(\partial^L_1)=n-1$…

Combinatorics · Mathematics 2017-04-12 Lu Lu , Qiongxiang Huang , Xueyi Huang

We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…

Probability · Mathematics 2023-10-25 Théo Lenoir

Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$ are {\it isomorphic up to complementation} if $G'$ is isomorphic to $G$ or to the complement $\bar G$ of $G$. Let $k$ be a non-negative…

Combinatorics · Mathematics 2016-08-16 Jamel Dammak , Gérard Lopez , Maurice Pouzet , Hamza Si Kaddour

Let $\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\Gamma$. If $\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard…

Combinatorics · Mathematics 2018-08-14 Vladimir Manuilov

In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition…

Discrete Mathematics · Computer Science 2026-05-19 Claudia Justel , Lilian Markenzon

In this paper we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix with structural parameters of the…

Spectral Theory · Mathematics 2024-08-12 Kauê Cardoso , Vilmar Trevisan

Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. Let $\overline{G}$ be the reduced graph of $G$, which can be…

Combinatorics · Mathematics 2025-07-09 Fenglei Tian , Dein Wong

In 2012, L\'ev\^eque, Maffray, and Trotignon conjectured that each graph $G$ that contains no induced subdivision of $K_4$ is $4$-colorable. In this paper, we prove that this conjecture holds when $G$ contains a $K_{1,2,3}$.

Combinatorics · Mathematics 2023-05-09 Rong Chen

Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we…

Quantum Physics · Physics 2007-05-23 Chai Wah Wu
‹ Prev 1 3 4 5 6 7 10 Next ›