Related papers: Integer Generalized Splines on Cycles
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
A signed graph is a graph whose edges are signed. In a vertex-signed graph the vertices are signed. The latter is called consistent if the product of signs in every circle is positive. The line graph of a signed graph is naturally…
Frank Harary introduced the concept of integral sum graph. A graph $G$ is an \emph{ integral sum graph} if its vertices can be labeled with distinct integers so that $e = uv$ is an edge of $G$ if and only if the sum of the labels on…
A signed graph is a graph where the edges are assigned labels of either "$+$" or "$-$". The sign of a cycle in the graph is the product of the signs of its edges. We equip each signed complete graph with a vector whose entries are the…
A set of vertices of a graph is said to be in general position if no three vertices from the set lie on a common geodesic. Recently Klav\v{z}ar, Rall and Yero generalized this notion by defining a set of vertices to be in general…
The generalized list $T$-coloring is a common generalization of many graph coloring models, including classical coloring, $L(p,q)$-labeling, channel assignment and $T$-coloring. Every vertex from the input graph has a list of permitted…
A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…
The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of…
Let $G_\omega$ be an edge-weighted simple graph. In this paper, we give a complete characterization of the graph $G_\omega$ whose edge ideal $I(G_\omega)$ is integrally closed. We also show that if $G_\omega$ is an edge-weighted star graph,…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
The general position number ${\rm gp}(G)$ of a graph $G$ is the cardinality of a largest set of vertices $S$ such that no element of $S$ lies on a geodesic between two other elements of $S$. The complementary prism $G\overline{G}$ of $G$ is…
An edge of a graph of order $n$ is pancyclic if it lies in a cycle of every length $3,\ldots,n$. A graph of order $n$ is vertex-pancyclic if every vertex lies in a cycle of every length $3,\ldots,n$. Recently, Li and Zhan proved that every…
This paper investigates a generalized hyperbolic circle packing (including circles, horocycles or hypercycles) with respect to the total geodesic curvatures on the surface with boundary. We mainly focus on the existence and rigidity of…
The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…
In this paper we obtain closed formulae for several parameters of generalized Sierpi\'{n}ski graphs $S(G,t)$ in terms of parameters of the base graph $G$. In particular, we focus on the chromatic, vertex cover, clique and domination…
A good edge-labeling of a graph [Ara\'ujo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there exist two non-decreasing paths. In this paper, we study…
We describe all inequalities among generalized diagonals in positive semi-definite matrices. These turn out to be governed by a simple partial order on the symmetric group. This provides an analogue of results of Drake, Gerrish, and…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total…
To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…