Nano Structural Properties of Lead Doped Cadmium Sulfide (Cd1-xPbxS) Thin Films Deposited by Spray Pyrolysis Technique
Some Structural Results on Prime Graphs
Keywords:Graphs, Prime Graphs, Module, And Decomposition
Lead doped cadmium sulfide thin films Cd1-xPbxS (0 ≤ x ≥ 0.20) were deposited onto a glass substrate at a temperature of 523K at a low-cost spray pyrolysis technique. They were characterized by their structural and optical properties, by energy dispersive x-ray analysis, scanning electron microscopy, x-ray diffraction respectively. X-ray diffraction patterns of the films are identified as (100), (002), (101), (102), (110), (103) and (201) planes which have a hexagonal crystal structure. No extra peak developing with the increasing Pd concentration. The direct bandgap energy of the film depends on the concentration. This value varies from 2.52 eV to 2.17 eV as required for solar cell and optoelectronic device applications.
A. Ehrenfeucht, T. Harju and G. Rozenberg, The Theory of 2-Structures. A Framework for Decomposition and Transformation of Graphs, World Scientific, Singapore (1999).
I. Bodacious and P. Ille, Critical and infinite directed graphs, Discrete Math. 307 (2007) 2415-2428.
Y. Bodacious and P. Ille, Indecomposability graphs and critical vertices of an indecomposable graph, Discrete Math. 309 (2009) 2839-2846.
A. Brandst¨adt and D. Kratsch, On the structure of (P5, gem)-free graphs, Discrete Applied Mathematics 145, (2005) 155-166.
M. Chudnovsky and P. Maceli, Simplicial vertices in graphs with no induced four-edge path or four-edge antipathy, and the H6-conjecture, Journal of Graph Theory, Vol 76, Issue 4, (2014) 249261.
M. Chudnovsky and P. Seymour, Growing without cloning, SIAM. Discrete Math., vol. 26, No. 2 (2012) 860-880.
A. Cournier and M. Habib, an efficient algorithm to recognize prime undirected graphs, in Graph-Theoretic Concepts in Computer Science, Proceedings of the 18th Internat. The workshop, WG’92, Wiesbaden-Naurod, Germany, June 1992, in: E. W. Mayr(Ed.), Lecture Notes in Computer Science, Vol. 657, Springer, Berlin pp. 212-224 (1993).
A. Ehrenfeucht and G. Rozenberg, Primitivity is hereditary for 2-structures, fundamental study, Theoret. Comput. Sci. 3 (70), 343-358 (1990).
J.L. Fouquet, Adecompostion for a class of (P5, P5)-free graphs, Discrete Mathematics 121 (1993) 75-83.
R. Fra¨ıss´e, L’intervalleenth´eorie des relations, sesg´en´eralisations, filtreintervallaire et clˆotured’une relation, in: M. Pouzet and D. Richard eds., Order, Description and Roles, North-Holland, Amsterdam, (1984) 313- 342.
T. Gallai, TransitivorientierbareGraphen, Acta. Math. Acad. Sci. Hungar., 18 (1967) 25-66.
P. Ille, Indecomposable graphs, Discrete Math. 173 (1997) 71-78.
P. Ille, A new proof of the main theorem of the paper: P. Ille, Indecomposable graphs, Discrete Math. 173 (1997) 71-78, Homepage of Pierre Ille.
P. Ille, A characterization of the Indecomposable and Infinite Graphs, Glob. J. Pure, Appl. Math. volume 1, Number 3, 272-285 (2005).
M. Pouzet and I. Zaguia, On minimal prime graphs and posets, Order Vol. 26 No. 4, (2009) 357-375.
J.H. Schmerl and W.T. Trotter, Critically indecomposable ordered sets, graphs, tournaments and other binary relation structures, Discrete Math. 113, 191-205 (1993).
J. Spinrad, P4-trees and substitution decomposition, Discrete Appl. Math. 39 (1992) 263-291.
D.P. Sumner, Graphs indecomposable with respect to X-join, Discrete Math. 6, (1973) 281-298