相关论文: An Optimal Algorithm to Generate Pointed Trivalent…
In network theory, a triad census is a method designed to categorize and enumerate the various types of subgraphs with three nodes and their connecting edges within a network. Triads serve as fundamental building blocks for comprehending…
Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We develop operations on their associated labeled graphs that will effectively construct from a single…
The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic chromatic index} is the analogous graph parameter for edge…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis, and have been used…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We provide the first solution to the problem of counting rooted 3-connected bipartite planar maps. Our starting point is the enumeration of bicoloured planar maps according to the number of edges and monochromatic edges, following Bernardi…
A connected graph is 4-connected if it contains at least five vertices and removing any three of them does not disconnect it. A frequent preprocessing step in graph drawing is to decompose a plane graph into its 4-connected components and…
A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero with multiplicity one such that its corresponding eigenvector has no zero entries. It is known that there exist no cubic circulant nut graphs. A bicirculant (resp.…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$,…
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f:E \to\{1,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label…
Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and…
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconnected graph is a strongly biconnected digraph that has the…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and colors of other vertices. We first extend the enumeration…