CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Trees in Disemigraphs

by Hamida Aktara Hoque, P. Das
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 146 - Number 9
Year of Publication: 2016
Authors: Hamida Aktara Hoque, P. Das
10.5120/ijca2016910845

Hamida Aktara Hoque, P. Das . Trees in Disemigraphs. International Journal of Computer Applications. 146, 9 ( Jul 2016), 6-12. DOI=10.5120/ijca2016910845

@article{ 10.5120/ijca2016910845,
author = { Hamida Aktara Hoque, P. Das },
title = { Trees in Disemigraphs },
journal = { International Journal of Computer Applications },
issue_date = { Jul 2016 },
volume = { 146 },
number = { 9 },
month = { Jul },
year = { 2016 },
issn = { 0975-8887 },
pages = { 6-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume146/number9/25424-2016910845/ },
doi = { 10.5120/ijca2016910845 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:49:56.330311+05:30
%A Hamida Aktara Hoque
%A P. Das
%T Trees in Disemigraphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 146
%N 9
%P 6-12
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

E. Sampathkumar [5] generalized the concept of graphs to semigraphs and that of digraphs to disemigraphs. Looking for an analogue of tree for the semigraph he introduced the concept of dendroid and tree, and also developed some of its significant characterizations. Analogous to his study of dendroids and trees in semigraphs, an attempt has been made to develop the concept of trees in disemigraph setting and derive some characterizations thereof. These results are primarily aimed at introducing the structural behaviour of the theory of disemigraphs.

References
  1. A. Cayley, On the theory of an analytical forms called trees, Philos. Mag. 13(1857) 19-30. Mathematical Papers, Cambridge 3(1891), 242-246.
  2. Bang-Jensen, Jorgen. & Gutin, Gregory. Digraphs-Theory, Algorithms and Applications, Springer-Verlag, 2007.
  3. C. Berge, The theory of graphs and its applications, Methuen and Co., London, 1962.
  4. Dhiraj Kumar Deka, Application of Graph Theory in Phylogenetics: The Primate Approach, Asia Pacific Mathematics Newsletter.
  5. E. Sampathkumar, Semigraphs and Their Applications, Report on the DST Project, May 2000.
  6. F. Harary, Graph Theory, Narosa Publishing House, Reprint 2001.
  7. F. Harary, R.Z. Norman, D. Cartwright, Structural Models: an introduction to the theory of directed graphs, Wiley, New York, 1965.
  8. G. Chartrand, Linda Lesnaik, Graphs and Digraphs, second edition, 1986.
  9. G. Kirchhoff, Über die Auflӧsung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Strӧme geführt wird, Ann. Phys. Chem., 72(1847), 497-508.
  10. Hamida Aktara Hoque, P. Das, Hamiltonian Disemigraphs, The International Journal of Science & Technoledge, Vol. 4, Issue 3, March-2016, pp 120-126.
  11. L. R. Foulds, Graph Theory Applications, Narosa Publishing House, 1993.
  12. Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science, New Delhi, 2009.
  13. P. Das, Hamida Aktara Hoque, A Note on Tournaments in Disemigraph, International Journal of Mathematical Science & Engineering Applications, Vol.6, No.II, 2012, pp. 299-307.
Index Terms

Computer Science
Information Sciences

Keywords

Semigraph disemigraph dendroid tree.

Powered by PhDFocusTM