Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 26 November 2018Accepted: 06 2020Published online: 21 January 2021Keywordsimmersions, tree-cut width, graph modification problems, edge-deletion distance, kernelizationAMS Subject Headings05C70, 05C75, 05C83, 05C85Publication DataISSN (print): 0895-4801ISSN (online): 1095...

A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and every assignment of lists of size four to the vertices of the graph, there exists a linear coloring such that the color of each vertex belongs to the list a...

Defining a sound shift operator for signals existing on a certain graphical structure, similar to the well-defined shift operator in classical signal processing, is a crucial problem in graph signal processing. Since almost all operations, such as filtering, transformation, prediction, etc., are directly related to the graph shift operator. We define a unique shift operator that satisfies all p...

abstract: in this study an appropriate computational approach was presented for estimating the boiling temperatures of 41 different types of olefins and their derivatives. based on the guidelines of this approach, several structural indices related to the organic components were applied using graph theory. meanwhile, in addition to evaluating the relation between the boiling temperatures of ole...

This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H , ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H . If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its root graph construction. During the root graph cons...

The linear arboricity la(G) of a graph G is the minimum number of linear forests (graphs where every connected component is a path) that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum degree ∆ is either ⌈ ∆ 2 ⌉

The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-linear indexing time or super-linear index...