The first and second Zagreb indices of hypergraphs

Let \mathcal{H} be a hypergraph on the non-empty finite vertex set V(\mathcal{H}) with the hyperedge set E(\mathcal{H}), where each hyperedge e\in E(\mathcal{H}) is a subset of V(\mathcal{H}) with at least two vertices.The bounds on the first and second Zagreb indices of hypergraphs, weak bipartite hypergraphs, hypertrees, k-uniform hypergraphs, k-uniform weak bipartite hypergraphs, and k-uniform hypertrees are discussed.

کلیدواژه ها:

hypergraph ، hypertree ، First Zagreb index ، second Zagreb index