相关论文: Planarity of generalized ladder graphs

A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

In the paper, we extend the ADC property to the representation of quadratic lattices by quadratic lattices, which we define as $ n $-ADC-ness. We explore the relationship between $ n$-ADC-ness, $ n $-regularity and $ n $-universality for…

Some well-known results of Prodinger and Tichy are that the number of independent sets in the $n$-vertex path graph is $F_{n+2}$, and that the number of independent sets in the $n$-vertex cycle graph is $L_n$. We generalize these results by…

Let $R$ be a finite product of integral domains and $D$ be a union of prime ideals (it is possible that $R$ is just an integral domain). Let $n \geq 1$ be a positive integer. This paper introduces the $n$-total graph of a $(R, D)$. The…

Let $c\in (0, 1]$ be a real number and let $n$ be a sufficiently large integer. We prove that every $n$-vertex $c n$-regular graph $G$ contains a collection of $\lfloor 1/c \rfloor$ paths whose union covers all but at most $o(n)$ vertices…

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…

In this work we consider some problems about a reflected graph map germ $f$ from $(\mathbb{C}^n,0)$ to $(\mathbb{C}^{n+1},0)$. A reflected graph map is a particular case of a reflection map, which is defined using an embedding of…

The generalized vector is defined on an $n$ dimensional manifold. Interior product, Lie derivative acting on generalized $p$-forms, $-1\le p\le n$ are introduced. Generalized commutator of two generalized vectors are defined. Adding a…

Consider pairs of the form (G, N), with G a group and N \normal G, as objects of a category \PG. A morphism (G_1, N_1) \To (G_2, N_2) will be a group homomorphism f : G_1 \To G_2 such that f(N_1) \subset N_2. We introduce a functor Q : \PG…

We investigate locally $n \times n$ grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on $n$ vertices. We consider the subclass of these graphs for which each pair of…

Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows. A set $S$ of vertices in a graph $G$ is a general…

We show that the method to construct C^*-algebras from topological graphs, introduced in our previous paper, generalizes many known constructions. We give many ways to make new topological graphs from old ones, and study the relation of…

We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…

Let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over a division ring $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency, ${\mathbb{D}}^{m\times n}$ is a…

Let $\mathcal{L}$ be a finite-dimensional semisimple Lie algebra of rank $N$ over an algebraically closed field of characteristic $0$. Associated to $\mathcal{L}$ is a family of polynomial folding maps…

A graph is a core or unretractive if all its endomorphisms are automorphisms. Well-known examples of cores include the Petersen graph and the graph of the dodecahedron -- both generalized Petersen graphs. We characterize the generalized…

It is well-known that the pancake graphs are widely used as models for interconnection networks \cite{Akers}. In this paper, some properties of the pancake graphs are investigated. We first prove that the pancake graph, denoted by $P_n…

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…