相关论文: Degree sequence of the generalized Sierpinski grap…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…
In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between all pairs of vertices of the graph, and most…
A generalized spline on an edge labeled graph $(G,\alpha)$ is defined as a vertex labeling, such that the difference of labels on adjacent vertices lies in the ideal generated by the edge label. We study generalized splines over greatest…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
We introduce a generalization of the zig-zag product of regular digraphs (directed graphs), which allows us to construct regular digraphs with m ore flexible choices of the degrees. In our generalization, we can control the connectivity of…
The Erd\H{o}s--Gallai criteria for recognizing degree sequences of simple graphs involve a system of inequalities. Given a fixed degree sequence, we consider the list of differences of the two sides of these inequalities. These differences…
For every positive integer $n$, we find a complete classification for planar graphs according to the collection of numbers of common neighbours for every $n$-tuple of distinct vertices. Our results expand the literature on planar graphical…
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic number of Sierpi\'nski graphs and to give a short proof that…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.
We construct genus one curves on base extensions of generic Severi--Brauer varieties of a given index and period which are versal objects for families of geometrically elliptic normal curves. We also compute the periods and indices of these…
Let G = G(V,E) be a graph with | V | vertices and | E | edges and total graph, T(G) is obtained from G. In This paper we have study the Harmonic index of total graph for standards graphs, bipartite graph of particular type, regular graph,…
F-index of a graph is the sum of the cube of the degrees of the vertices. In this paper, we investigate the F-indices of unicyclic graphs by introducing some transformation, and characterize the unicyclic graphs with the first five largest…
In this paper, we characterize the structure and topological indices of a class of random spider trees (RSTs) such as degree-based Gini index, degree-based Hoover index, generalized Zagreb index and other indices associated with these. We…
The sigma index in graph theory refers to a measure of the degree differences between vertices in a graph. The goal is to determine the graphs that have the maximum sigma index within certain classes of graphs. Abdo, Dimitrov, and Gutman…
The paper discusses the edge hyper-Zagreb index of a graph, which is calculated by replacing vertex degrees with edge degrees. The degree of an edge is determined by adding up the degrees of the end vertices of the edge and subtracting 2.…
A long-standing and well-known conjecture (see e.g. Caro, Discrete Math, 1994) states that every $n$-vertex graph $G$ without isolated vertices contains an induced subgraph where all vertices have an odd degree and whose order is linear in…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We provide a resultant-based formula for the total degree w.r.t. the spatial variables of the generic offset to a parametric surface. The parametrization of the surface is not assumed to be proper.