English
Related papers

Related papers: A complete classification of which $(n,k)$-star gr…

200 papers

If all the eigenvalues of the Hermitian-adjacency matrix of a mixed graph are integers, then the mixed graph is called \emph{H-integral}. If all the eigenvalues of the (0,1)-adjacency matrix of a mixed graph are \emph{Gaussian integers},…

Combinatorics · Mathematics 2023-02-17 Monu Kadyan , Bikash Bhattacharjya

In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.

Combinatorics · Mathematics 2024-02-27 Haimiao Chen

Proposed as a general framework, Liu and Yu(Discrete Math. 231 (2001) 311-320) introduced $(n,k,d)$-graphs to unify the concepts of deficiency of matchings, $n$-factor-criticality and $k$-extendability. Let $G$ be a graph and let $n,k$ and…

Combinatorics · Mathematics 2007-05-23 Zemin Jin , Huifang Yan , Qinglin Yu

A graph $G=(V,E)$ is defined as a star-$k$-PCG when it is possible to assign a positive real number weight $w$ to each vertex $V$, and define $k$ distinct intervals $I_1, I_2, \ldots I_k$, in such a way that there is an edge $uv$ in $E$ if…

Discrete Mathematics · Computer Science 2024-10-22 Angelo Monti , Blerina Sinaimeri

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…

Computational Geometry · Computer Science 2007-05-23 David Eppstein , Michael T. Goodrich , Jeremy Yu Meng

In a prior work, the galaxies of the nonstandard enlargements of conventionally infinite graphs and also of transfinite graphs of the first rank of transfiniteness were defined, examined, and illustrated by some examples. In this work it is…

Combinatorics · Mathematics 2007-05-23 A. H. Zemanian

This paper deals with some of the algebraic properties of Sierpi\'nski graphs and a family of regular generalized Sierpi\'nski graphs. For the family of regular generalized Sierpi\'nski graphs, we obtain their spectrum and characterize…

A compact review is given, and a few new numerical results are added to the recent studies of the q-pointed one-dimensional star-shaped quantum graphs. These graphs are assumed endowed with certain specific, manifestly non-Hermitian point…

Quantum Physics · Physics 2013-06-28 Miloslav Znojil

A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the…

General Topology · Mathematics 2012-09-26 Benjamin Espinoza , Paul Gartside , Ana Mamatelashvili

In 2013, Jemal Abawajy, Andrei Kelarev and Morshed Chowdhury [1] proposed a problem to characterize the finite groups whose power graphs are Cayley graphs of some groups. Here we give a complete answer to this question.

Combinatorics · Mathematics 2015-07-20 S. Mukherjee , A. K. Bhuniya

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…

Combinatorics · Mathematics 2018-01-08 Ove Ahlman

Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…

Combinatorics · Mathematics 2023-06-26 Angelot Behajaina , François Legrand

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, ordinary star-like self-contained graphs are introduced and it is shown that every ordinary star-like self-contained…

Combinatorics · Mathematics 2015-03-11 Mohammad Hadi Shekarriz , Madjid Mirzavaziri

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…

Data Structures and Algorithms · Computer Science 2019-04-23 Takashi Horiyama , Jun Kawahara , Shin-ichi Minato , Yu Nakahata

The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertices are all the $k$-subsets of $V(G)$; with two of them adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. In this paper, we study the domination…

Combinatorics · Mathematics 2025-09-23 Ruy Fabila-Monroy , Sergio Gerardo Gómez-Galicia

A subset $C$ of the vertex set of a graph $\Gamma$ is said to be $(a,b)$-regular if $C$ induces an $a$-regular subgraph and every vertex outside $C$ is adjacent to exactly $b$ vertices in $C$. In particular, if $C$ is an $(a,b)$-regular set…

Combinatorics · Mathematics 2024-01-30 Asamin Khaefi , Zeinab Akhlaghi , Behrooz Khosravi

This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…

Logic · Mathematics 2016-09-06 Eric Rosen , Saharon Shelah , Scott Weinstein

A Cayley graph is said to be an NNN-graph if it is both normal and non-normal for isomorphic regular groups, and a group has the NNN-property if there exists an NNN-graph for it. In this paper we investigate the NNN-property of cyclic…

Combinatorics · Mathematics 2019-08-26 Michael Giudici , Luke Morgan , Yian Xu

The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…

Combinatorics · Mathematics 2016-04-26 Saeid Alikhani , Davood Fatehi , Sandi Klavžar

This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…

Discrete Mathematics · Computer Science 2016-02-16 Martin Grohe