Convex sets in lexicographic products of graphs

DOI10.1007/s00373-011-1031-4zbMath1234.05069OpenAlexW2080743565MaRDI 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 setslexicographic product of graphsSteiner sets

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (15)

Intervals and convex sets in strong product of graphs ⋮ The average Steiner 3-eccentricity of block graphs ⋮ A note on the convexity number of the complementary prisms of trees ⋮ Some Steiner concepts on lexicographic products of graphs ⋮ The pre-hull number and lexicographic product ⋮ Proper connection number of graph products ⋮ On the average Steiner 3-eccentricity of trees ⋮ The Steiner \(k\)-eccentricity on trees ⋮ Steiner convex sets and Cartesian product ⋮ A Steiner general position problem in graph theory ⋮ On the contour of bipartite graphs ⋮ Toll convexity ⋮ Rainbow vertex-connection and graph products ⋮ Rainbow connection and graph products ⋮ Modular decomposition of graphs and the distance preserving property

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

This page was built for publication: Convex sets in lexicographic products of graphs