ON LABEL GRAPHOIDAL COVERING NUMBER-I

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAHUL HAMID I.; ANITHA A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2012 | Volume:1 | Issue:4 Page(s): 25-33

Download Full-Text

Persian Verion

View:

1,139

Download:

174

Cites:

Information Journal Paper

Title

ON LABEL GRAPHOIDAL COVERING NUMBER-I

Author(s)

SAHUL HAMID I. | ANITHA A. | Issue Writer Certificate

Keywords

GRAPHOIDAL LABELINGQ2

LABEL GRAPHOIDAL GRAPHQ2

LABEL GRAPHOIDAL COVERING NUMBERQ2

Abstract

Let G=(V, E) be a graph with p vertices and q edges. An acyclic graphoidal cover of G is a collection y of paths in G which are internally-disjoint and cover each edge of the graph exactly once. Let f:V® {1, 2, …, P} be a bijective labeling of the vertices of G. Let Gf be the directed graph obtained by orienting the edgesuv of G from u to v provided f(u)<f(v). If the set yf of all maximal directed paths in Gf, with directions ignored, is an acyclic graphoidal cover of G, then f is called a GRAPHOIDAL LABELING of G and G is called a LABEL GRAPHOIDAL GRAPH and hi=min {½yf½: f is a GRAPHOIDAL LABELING of G} is called the LABEL GRAPHOIDAL COVERING NUMBER of G. In this paper we characterize graphs for which (i) hi=q-m, where m is the number of vertices of degree 2 and (ii) hi=q. Also, we determine the value of LABEL GRAPHOIDAL COVERING NUMBER for unicyclic graphs.

Cites

No record.

References

No record.

Cite

APA: Copy

SAHUL HAMID, I., & ANITHA, A.. (2012). ON LABEL GRAPHOIDAL COVERING NUMBER-I. TRANSACTIONS ON COMBINATORICS, 1(4), 25-33. SID. https://sid.ir/paper/213767/en

Vancouver: Copy

SAHUL HAMID I., ANITHA A.. ON LABEL GRAPHOIDAL COVERING NUMBER-I. TRANSACTIONS ON COMBINATORICS[Internet]. 2012;1(4):25-33. Available from: https://sid.ir/paper/213767/en

IEEE: Copy

I. SAHUL HAMID, and A. ANITHA, “ON LABEL GRAPHOIDAL COVERING NUMBER-I,” TRANSACTIONS ON COMBINATORICS, vol. 1, no. 4, pp. 25–33, 2012, [Online]. Available: https://sid.ir/paper/213767/en

Related Journal Papers