On combination and permutation graphs

MaRDI QIDQ2811827zbMATH OpenFDO

Authors M. A. Seoud, M. Anwar

Publication date 10 June 2016

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

combinationpermutationstrong \(k\)-combinationstrong \(k\)-strong permutation graphs

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

The note extends previous work by other authors on the characterization of certain combination and permutation graphs. It gives some necessary conditions for a graph to be a combination graph, a permutation graph, a strong \(k\)-combination graph and a strong \(k\)-permutation graph. It also characterizes all maximal strong \(k\)-combination graphs of order less than 7.

Recommendations

• Combinatorial labelings of graphs
• Some notes on combination graphs.
• Some families of combination and permutation graphs.
• On permutation graphs
• scientific article; zbMATH DE number 4066932

Cited in

(13)

• Permutations generated by token passing in graphs
• On k-complementing permutations of cyclically k-complementary graphs
• On permutation graphs
• The combinatorial compound of permutation matrix and graphical representation
• Some families of combination and permutation graphs.
• Permutations in Coinductive Graph Representation
• Some notes on combination graphs.
• Seidel minor, permutation graphs and combinatorial properties
• On Comparability and Permutation Graphs
• scientific article; zbMATH DE number 4063148 (Why is no real title available?)
• scientific article; zbMATH DE number 2076924 (Why is no real title available?)
• Combinatorial parameters on bargraphs of permutations
• On probe permutation graphs

This page was built for publication: On combination and permutation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811827)