Global domination and neighborhood numbers in Boolean function graph of a graph

T. N. Janakiraman; S. Muthammai; M. Bhanumathi

Mathematica Bohemica (2005)

  • Volume: 130, Issue: 3, page 231-246
  • ISSN: 0862-7959

Abstract

top
For any graph G , let V ( G ) and E ( G ) denote the vertex set and the edge set of G respectively. The Boolean function graph B ( G , L ( G ) , N I N C ) of G is a graph with vertex set V ( G ) ∪ E ( G ) and two vertices in B ( G , L ( G ) , N I N C ) are adjacent if and only if they correspond to two adjacent vertices of G , two adjacent edges of G or to a vertex and an edge not incident to it in G . In this paper, global domination number, total global domination number, global point-set domination number and neighborhood number for this graph are obtained.

How to cite

top

Janakiraman, T. N., Muthammai, S., and Bhanumathi, M.. "Global domination and neighborhood numbers in Boolean function graph of a graph." Mathematica Bohemica 130.3 (2005): 231-246. <http://eudml.org/doc/249584>.

@article{Janakiraman2005,
abstract = {For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respectively. The Boolean function graph $B(G, L(G), \mathop \{\mathrm \{N\}INC\})$ of $G$ is a graph with vertex set $V(G)\cup E(G)$ and two vertices in $B(G, L(G), \mathop \{\mathrm \{N\}INC\})$ are adjacent if and only if they correspond to two adjacent vertices of $G$, two adjacent edges of $G$ or to a vertex and an edge not incident to it in $G$. In this paper, global domination number, total global domination number, global point-set domination number and neighborhood number for this graph are obtained.},
author = {Janakiraman, T. N., Muthammai, S., Bhanumathi, M.},
journal = {Mathematica Bohemica},
keywords = {Boolean function graph; global domination number; neighborhood number; global domination number},
language = {eng},
number = {3},
pages = {231-246},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Global domination and neighborhood numbers in Boolean function graph of a graph},
url = {http://eudml.org/doc/249584},
volume = {130},
year = {2005},
}

TY - JOUR
AU - Janakiraman, T. N.
AU - Muthammai, S.
AU - Bhanumathi, M.
TI - Global domination and neighborhood numbers in Boolean function graph of a graph
JO - Mathematica Bohemica
PY - 2005
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 130
IS - 3
SP - 231
EP - 246
AB - For any graph $G$, let $V(G)$ and $E(G)$ denote the vertex set and the edge set of $G$ respectively. The Boolean function graph $B(G, L(G), \mathop {\mathrm {N}INC})$ of $G$ is a graph with vertex set $V(G)\cup E(G)$ and two vertices in $B(G, L(G), \mathop {\mathrm {N}INC})$ are adjacent if and only if they correspond to two adjacent vertices of $G$, two adjacent edges of $G$ or to a vertex and an edge not incident to it in $G$. In this paper, global domination number, total global domination number, global point-set domination number and neighborhood number for this graph are obtained.
LA - eng
KW - Boolean function graph; global domination number; neighborhood number; global domination number
UR - http://eudml.org/doc/249584
ER -

References

top
  1. On characterizations of the middle graphs, Tru. Math. (1975), 35–39. (1975) MR0414436
  2. A criterion for the planarity of the total graph of a graph, Proc. Cambridge Philos. Soc. 63 (1967), 679–681. (1967) Zbl0158.20703MR0211896
  3. Semi total graphs II, Graph Theory Research Report, Karnatak University (1973), 5–9. (1973) 
  4. 10.1002/net.3230100304, Networks 10 (1980), 211–219. (1980) MR0584887DOI10.1002/net.3230100304
  5. 10.1016/0012-365X(76)90037-6, Discrete Math. 14 (1976), 247–256. (1976) MR0414435DOI10.1016/0012-365X(76)90037-6
  6. Graph Theory, Addison-Wesley, Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911
  7. On the Boolean function graph of a graph and on its complement, Math. Bohem. 130 (2005), 113–134. (2005) MR2148646
  8. The total global domination number of a graph, Indian J. Pure Appl. Math. 27 (1996), 537–542. (1996) MR1390876
  9. Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence, 1962. (1962) Zbl0105.35401MR0150753
  10. The global point-set domination number of a graph, Indian J. Pure Appl. Math. 28 (1997), 47–51. (1997) Zbl0871.05036MR1442817
  11. The global domination number of a graph, J. Math. Phys. Sci. 23 (1989), 377–385. (1989) Zbl0729.05045MR1023310
  12. The neighborhood number of a graph, Indian J. Pure Appl. Math. 16 (1985), 126–132. (1985) MR0780299
  13. Point-set domination number of a graph, Indian J. Pure Appl. Math. 24 (1993), 225–229. (1993) MR1218532
  14. The connected domination number of a graph, J. Math. Phys. Sci. 13, 607–613. MR0575817
  15. 10.1016/0012-365X(84)90137-7, Discrete Math. 48 (1984), 113–119. (1984) MR0732207DOI10.1016/0012-365X(84)90137-7
  16. 10.2307/2371086, Amer. J. Math. 54 (1932), 150–168. (1932) Zbl0003.32804MR1506881DOI10.2307/2371086

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.