Termination of the iterated strong-factor operator on multipartite graphs

DOI10.1016/j.tcs.2015.01.009zbMath1306.05234OpenAlexW1974993785MaRDI QIDQ2512660

Christophe Crespelle, The Hung Tran, Thi Ha Duong Phan

Publication date: 30 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.009

zbMATH Keywords

terminationfactor operatormultipartite graph seriesstrong-factor operator

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Diclique digraphs ⋮ On the termination of some biclique operators on multipartite graphs

Cites Work

• On the termination of some biclique operators on multipartite graphs
• Contractibility and the clique graph operator
• The clique operator on circular-arc graphs
• Edge-clique graphs
• Convergence of iterated clique graphs
• The clique operator on cographs and serial graphs
• Clique divergent clockwork graphs and partial orders
• On clique convergent graphs
• Bipartite structure of all complex networks
• The number of convergent graphs under the biclique operator with no twin vertices is finite
• Termination of Multipartite Graph Series Arising from Complex Network Modelling
• On the Iterated Biclique Operator
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination of the iterated strong-factor operator on multipartite graphs