A Note on Full and Complete Binary Planar Graphs


Mail Emily L Casinillo(1)
Mail Leomarich F Casinillo(2*)

(1) Visayas State University, Philippines
(2) Visayas State University, Philippines
(*) Corresponding Author
10.31002/ijome.v3i2.2800| Abstract views : 0 | PDF views : 0


Let G=(V(G), E(G)) be a connected graph where V(G) is a finite nonempty set called vertex-set of G, and  E(G) is a set of unordered pairs {u, v} of distinct elements from  V(G) called the edge-set of G. If  is a connected acyclic graph or a connected graph with no cycles, then it is called a tree graph. A binary tree Tl with l levels is complete if all levels except possibly the last are completely full, and the last level has all its nodes to the left side. If we form a path on each level of a full and complete binary tree, then the graph is now called full and complete binary planar graph and it is denoted as Bn, where n is the level of the graph. This paper introduced a new planar graph which is derived from binary tree graphs. In addition, a combinatorial formula for counting its vertices, faces, and edges that depends on the level of the graph was developed.


binary tree graph; combinatorial formula; planar graph

Full Text:



Bollobás, B. (1998). Modern graph theory. New York: Springer-Verlag.

Casinillo, L. F. (2018). A note on Fibonacci and Lucas number of domination in path. Electronic Journal of Graph Theory and Applications, 6(2), 317–325.

Casinillo, L. F. (2020a). Odd and even repetition sequences of independent domination number. Notes on Number Theory and Discrete Mathematics, 26(1), 8-20.

Casinillo. L. F. (2020b). Some new notes on Mersenne primes and perfect numbers. Indonesian Journal of Mathematics Education, 3(1), 15-22.

Casinillo, L. F., Lagumbay, E. T., & Abad, H. R. F. (2017). A note on connected interior domination in join and corona of two graphs. IOSR Journal of Mathematics, 13(2), 66–69.

Chartrand, G. & Zhang, P. (2012) A first course in graph theory. New York: Dover Publication, Inc.

Guichard, D. (2018). An introduction to combinatorics and graph Theory. . USA: Lecture Notes.

Leithold, L. (1996). The calculus 7 (7th ed.). USA: Addison-Wesley Publishing Company, Inc.

Ore, O. (1962). Theory of graphs. American Mathematical Society Providence, R. I.

Kumar, M. K., Murali, R., & Chidanandan, V. (2016). Domination in some classes of ditrees. Bulletin of the International Mathematical Virtual Institute, 6, 157-167.

Varkey, M. T. K. & Thomas, M. S. (2017). Some tree and tree related cubic graceful graphs. International Journal of Advanced Scientific and Technical Research, 7(4), 239-244.

DOI: http://dx.doi.org/10.31002/ijome.v3i2.2800

Article Metrics

Abstract view : 0 times
PDF - 0 times

Cited By


  • There are currently no refbacks.

Copyright (c) 2021 Indonesian Journal of Mathematics Education

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Indexed by:


ISSN: 2654-3907 (print) | 2654-346X (online)

Jalan Kapten Suparman No.39, Magelang, Jawa Tengah, Indonesia 56116

Phone (0293) 364113  Fax. (0293) 362438

Website : http://jurnal.untidar.ac.id/index.php/ijome