Convex sets in lexicographic products of graphs

DOI10.1007/s00373-011-1031-4zbMath1234.05069MaRDI QIDQ659762

Iztok Peterin, Manoj Changat, Bijo S. Anand, Sandi Klavžar

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1031-4

zbMATH Keywords

convex sets; lexicographic product of graphs; Steiner sets

Mathematics Subject Classification ID

05C12: Distance in graphs

05C76: Graph operations (line graphs, products, etc.)

Related Items

Rainbow vertex-connection and graph products, The pre-hull number and lexicographic product, Proper connection number of graph products, Steiner convex sets and Cartesian product, On the contour of bipartite graphs, Rainbow connection and graph products, Toll convexity, Modular decomposition of graphs and the distance preserving property, Intervals and convex sets in strong product of graphs, Some Steiner concepts on lexicographic products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
• Steiner intervals, geodesic intervals, and betweenness
• Convex sets in graphs. II: Minimal path convexity
• Steiner intervals in graphs
• The induced path convexity, betweenness, and svelte graphs
• Convexities related to path properties on graphs
• On the Steiner, geodetic and hull numbers of graphs
• Convex sets under some graph operations
• Induced path transit function, monotone and Peano axioms
• The All-Paths Transit Function of a Graph
• n-ary transit functions in graphs
• Minimal cycle bases of the lexigraphic product of graphs
• Power Domination in Product Graphs
• Small cycle double covers of products I: Lexicographic product with paths and cycles
• A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product