article · MyPrints@UOM (Mysore University Library) · 2010

Linear Hypergraph Set-Indexers of a Graph

B. D. Acharya, S. Ramanujan, K. A. Germina, Viji Paul

Cited by 1Abstract and details only

Abstract

Given any graph G = (V,E) and an arbitrary nonempty ‘ground set’ X, a linear hypergraph set-indexer (LHSI) is a set-valued function f: V (G) → 2X assigning nonempty subsets of X to the vertices of G and satisfying the following conditions: (i) the ordered pair Hf (G) = (X,f(V)), where f(V) = {f(v) : v ∈ V (G)}, is a ‘simple ’ hypergraph, in the sense that f is injective and ∪v∈V (G)f(v) = X, (ii) Hf (G) is a linear hypergraph, in the sense that |f(u) ∩ f(v) | ≤ 1 ∀ u, v ∈ V, (iii) the induced set-valued function f ⊕ : E → 2X defined by f⊕(uv) = f(u)⊕f(v), ∀ uv ∈ E is injective, and (iv) Hf⊕(G) = (X,f⊕(E)), where f⊕(E) = {f⊕(e) : e ∈ E}, is a linear hypergraph. In this paper, we initiate a study of linear hypergraph set-indexers of a graph.

Cite this paper

APA 7

Acharya, B. D., Ramanujan, S., Germina, K. A., & Paul, V. (2010). Linear Hypergraph Set-Indexers of a Graph. MyPrints@UOM (Mysore University Library).

MLA 9

Acharya, B. D., et al. “Linear Hypergraph Set-Indexers of a Graph.” MyPrints@UOM (Mysore University Library), 2010.

Chicago

Acharya, B. D., S. Ramanujan, K. A. Germina, and Viji Paul. 2010. “Linear Hypergraph Set-Indexers of a Graph.” MyPrints@UOM (Mysore University Library).

Harvard

Acharya, B.D. et al. (2010) ‘Linear Hypergraph Set-Indexers of a Graph’, MyPrints@UOM (Mysore University Library).

BibTeX

@article{acharya2010linear,
  title = {{Linear Hypergraph Set-Indexers of a Graph}},
  author = {Acharya, B. D. and Ramanujan, S. and Germina, K. A. and Paul, Viji},
  journal = {MyPrints@UOM (Mysore University Library)},
  year = {2010}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.