Skip to main content
Log in

Secure domination of honeycomb networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The topological structure of a network can be described by a connected graph \(G = (V, E)\) where V(G) is a set of nodes to be connected and E(G) is a set of direct communication links between the nodes. A physical connection between the different components of a parallel system is provided by an interconnection network. Many graph theoretic parameters are used to study the efficiency and reliability of an interconnection network. A set \(S \subseteq V(G)\) is said to be secure if the security condition, for every \(X \subseteq S\), \(\left| N[X] \cap S\right| \ge \left| N[X] - S\right| \) holds. Now, a set \(S \subseteq V(G)\) is secure dominating, if it is both secure and dominating. The secure domination number of G, is the minimum cardinality of a secure dominating set in G. In the current era, security is definitely a desirable property for the interconnection networks and hence these type of study has wide applications. In this paper, we have studied the security number and secure domination number of Honeycomb Networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Balakrishnan R, Ranganathan K (2012) A textbook of graph theory, 2nd edn. Springer, New York

    Book  Google Scholar 

  • Barnett J, Blumenthal A, Johnson P, Jones C, Matzke R, Mujuni E (2017) Connected minimum secure dominating sets in grids. AKCE Int J Gr Combin 14:216–223

    Article  MathSciNet  Google Scholar 

  • Brigham RC, Dutton RD, Hedetniemi ST (2007) Security in graphs. Discret Appl Math 155:1708–1714

    Article  MathSciNet  Google Scholar 

  • Dutton RD (2009) On a graph’s security number. Discret Math 309:4443–4447

    Article  MathSciNet  Google Scholar 

  • Dutton RD, Lee R, Brigham RC (2008) Bounds on a graph’s security number. Discret Appl Math 156:695–704

    Article  MathSciNet  Google Scholar 

  • Rajan B, Willian A, Grigorious C, Stephen S (2012) On certain topological indices of silicate, honeycomb and hexagonal networks. J Comput Math Sci 3(5):530–535

    Google Scholar 

  • Sharieh A, Qatawneh M, Almobaideen W, Sleit A (2008) Hex-cell: modelling, topological properties and routing algorithm. Eur J Sci Res 22(2):457–468

    Google Scholar 

  • Stomenovic I (1997) Honeycomb networks: topological properties and communication algorithm. IEEE Trans Paral Distrib Syst 8(10):1036–1042

    Article  Google Scholar 

  • Wang S, Liu JB, Wang C, Hayat S (2017) Further results on computation of topological indices of certain networks. IET Control Theory Appl 11(13):2065–2071

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank the referees for their suggestions for the refinement of the paper and their teacher Prof. A. Vijayakumar, CUSAT, Cochin for his constant inspiration to continue research work and suggestions for the improvement of the content in this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. R. Chithra.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chithra, M.R., Menon, M.K. Secure domination of honeycomb networks. J Comb Optim 40, 98–109 (2020). https://doi.org/10.1007/s10878-020-00570-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00570-8

Keywords

Mathematics Subject Classification

Navigation