The strong intersecting number of a graph

MaRDI QIDQ2721703zbMATH OpenFDO

Authors Liangui Weng, Yueling Gu, Tianxing Yao

Publication date 6 June 2002

Published in Journal of Nanjing University. Mathematical Biquarterly (Search for Journal in Brave)

zbMATH Keywords

line graphsimple hypergraphstrong intersecting number

Mathematics Subject Classification ID

Hypergraphs (05C65)

Review text

The line graph \(L(H)\) of a simple hypergraph \(H= (E_1,E_2,\dots, E_n)\) is a simple graph with vertex set \(\{v_1,v_2,\dots, v_n\}\), such that the vertices \(v_i\) and \(v_j\) are adjacent if and only if \(E_i\cap E_j\neq\varnothing\) \((i\neq j)\). The strong intersecting number \(\Omega(G)\) of a simple graph \(G\) is the minimum order of the simple hypergraphs \(H\) with \(L(H)\cong G\). The paper gives a necessary and sufficient condition for \(\Omega(G)=|E(G)|\) with the minimum degree of its vertices \(\geq 2\), and a sharp upper bound for the strong intersecting number.

Recommendations

• Recognizing intersection graphs of linear uniform hypergraphs
• On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
• A note on G-intersecting families
• On line graphs of linear 3-uniform hypergraphs
• Line hypergraphs

Cited in

(2)

• Strongly regular graphs and designs with three intersection numbers
• Strongly intersecting integer partitions

This page was built for publication: The strong intersecting number of a graph

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