scientific article; zbMATH DE number 851097

Publication date: 4 March 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

line graph discrete dynamical systems clique graph line digraph iterations total graph graph parameter graph dynamics centre antipodal graph graph operators wing graph

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)

Related Items (64)

Spectrum of Gallai graph of some graphs ⋮ Recent Results on Hyperbolicity on Unitary Operators on Graphs ⋮ Induced cycles in triangle graphs ⋮ Structural properties of word representable graphs ⋮ On the clique behavior of graphs of low degree ⋮ Mycielskian of graphs with small game domination number ⋮ On the hyperbolicity of bipartite graphs and intersection graphs ⋮ Real subset sums and posets with an involution ⋮ The dynamics of the forest graph operator ⋮ On neighborhood-Helly graphs ⋮ On strong graph bundles ⋮ Unnamed Item ⋮ Gallai graphs and anti-Gallai graphs ⋮ On cliques and bicliques ⋮ Gallai and anti-Gallai graph operators ⋮ Split clique graph complexity ⋮ On bicliques and the second clique graph of suspensions ⋮ Generalized line graphs: Cartesian products and complexity of recognition ⋮ An approximation algorithm for graph partitioning via deterministic annealing neural network ⋮ Clique‐convergence is undecidable for automatic graphs ⋮ Random Graphs, Retractions and Clique Graphs ⋮ Graph classes with and without powers of bounded clique-width ⋮ On self-clique graphs with triangular cliques ⋮ Diclique digraphs ⋮ The forbidden minor characterization of line-search antimatroids of rooted digraphs ⋮ Complexity functions for networks: dynamical hubs and complexity clusters ⋮ On the hardness of recognizing triangular line graphs ⋮ Recognizing \(k\)-path graphs ⋮ Edge contraction and edge removal on iterated clique graphs ⋮ Characterizing 2-distance graphs ⋮ Graphs whose complement and square are isomorphic ⋮ Characterization of super-radial graphs ⋮ Zero forcing in iterated line digraphs ⋮ Communication cliques in mobile phone calling networks ⋮ Characterization and recognition of generalized clique-Helly graphs ⋮ On clique convergence of graphs ⋮ Spectrum of anti-Gallai graph of some graphs ⋮ Eccentric completion of a graph ⋮ On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs ⋮ On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ An infinite family of self-diclique digraphs ⋮ The clique operator on graphs with few \(P_{4}\)'s ⋮ Searching for square-complementary graphs: complexity of recognition and further nonexistence results ⋮ Random walks and flights over connected graphs and complex networks ⋮ Recognizing edge clique graphs among interval graphs and probe interval graphs ⋮ On expansive graphs ⋮ The complexity of clique graph recognition ⋮ Cube intersection concepts in median graphs ⋮ Unnamed Item ⋮ Split Clique Graph Complexity ⋮ On the radius of neighborhood graphs ⋮ The clique operator on cographs and serial graphs ⋮ Dismantlings and iterated clique graphs ⋮ Clique divergent clockwork graphs and partial orders ⋮ On the clique behavior of circulants with three small jumps ⋮ Clique divergent graphs with unbounded sequence of diameters ⋮ Recognizing clique graphs of directed and rooted path graphs ⋮ The line completion number of hypercubes ⋮ Hyperbolicity on graph operators ⋮ On the Steiner antipodal number of graphs ⋮ The dynamics of the line and path graph operators ⋮ Histories in Path Graphs ⋮ Total domination on tree operators

This page was built for publication: