Buscar
Mostrando ítems 31-40 de 1919
Neighborhood covering and independence on P4-tidy graphs and tree-cographs
(Springer, 2020)
Given a simple graph G, a set C subset of V(G)\documentclass[12pt] is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v is an element of C\documentclass[12pt] denotes the subgraph of G ...
Neighborhood covering and independence on P4-tidy graphs and tree-cographs
(Springer, 2020)
Given a simple graph G, a set C subset of V(G)\documentclass[12pt] is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v is an element of C\documentclass[12pt] denotes the subgraph of G ...
Thinness of product graphs
(Elsevier Science, 2022)
Neighborhood covering and independence on P4-tidy graphs and tree-cographs
(Springer, 2017-11)
Given a simple graph G, a set (Formula presented.) is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with (Formula presented.), where G[v] denotes the subgraph of G induced by the closed ...
Fully Dynamic Recognition of Proper Circular-Arc Graphs
(Springer, 2015-04)
We present a fully dynamic algorithm for the recognition of proper circular-arc (PCA) graphs. The allowed operations on the graph involve the insertion and removal of vertices (together with its incident edges) or edges. ...
Arboricity, h-Index, and Dynamic Algorithms
(Elsevier Science, 2012-04)
We propose a new data structure for manipulating graphs, called -graph, which is particularly suited for designing dynamic algorithms. The structure itself is simple, consisting basically of a triple of elements, for each ...
Perfect state transfer, integral circulants and join of graphs
(2009-09-04)
We propose new families of graphs which exhibit quantum perfect state transfer. Our constructions are based on the join operator on graphs, its circulant generalizations, and
the Cartesian product of graphs. We build upon ...
An Analysis of Distributed Programming Models and Frameworks for Large-scale Graph Processing
(Taylor & Francis, 2020-04-30)
In recent years, processing and analysing large graphs has become a major need in many research areas. Distributed graph processing programming models and frameworks arised as a natural solution to process linked data of ...
Some links between identifying codes and separating, dominating and total dominating sets in graphs
(Elsevier, 2015-12)
In the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us ...