Lexicographic product and isoperimetric number

DOI10.1155/2013/243981MaRDI QIDQ2449264zbMATH OpenOpenAlexWikidataFDO

Authors Ersin Aslan, Alpay Kirlangic

Publication date 7 May 2014

Published in ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/243981

zbMATH Keywords

Cartesian products of graphsdiameter of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph operations (line graphs, products, etc.) (05C76)

Review text

Summary: The isoperimetric number of a graph \(G\), denoted by \(i(G)\), was introduced by \textit{B. Mohar} [J. Comb. Theory, Ser. B 47, No. 3, 274--291 (1989; Zbl 0719.05042)]. A graph \(G\) and a subset \(X\) of its vertices are given, and let \(\partial(X)\) denote the edge boundary of \(X\), the set of edges which connects vertices in \(X\) to vertices not in \(X\). The isoperimetric number of \(G\) is defined as \(i(G)=\min_{1\leq|X|\leq|V(G)|/2}(|\partial(X)|/|X|)\). In this paper, some results about the isoperimetric number of graphs obtained by graph operations are given.

Recommendations

• On the isoperimetric number of line graphs
• Isoperimetric numbers of graphs
• Publication:4489249
• Isoperimetric numbers of graph bundles
• Edge isoperimetric inequalities for product graphs

Cites work

• Isoperimetric numbers of graphs

Cited in

(4)

• Isoperimetric numbers of graph bundles
• On the isoperimetric number of line graphs
• Lexicographic products with high reconstruction numbers
• The pre-hull number and lexicographic product

This page was built for publication: Lexicographic product and isoperimetric number

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