Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and other standard graphs were studied. Also four prime cordial labeling behavior of complete graph, book, flower were studied. In this paper, we investigate the four prime cordial labeling behavior of corona of wh...

The Friendship theorem states that if any two people in a party have exactly one common friend, then there exists a politician who is a friend of everybody. In this paper, we generalize the Friendship Theorem. Let λ be any nonnegative integer and μ be any positive integer. Suppose each pair of friends have exactly λ common friends and each pair of strangers have exactly μ common friends in a pa...

Basically, the new topic of dominant local metric dimension which be symbolized by Ddim_l (H) is a combination two concepts in graph theory, they were called and dominating set. There are some terms this that resolving set basis. An ordered subset W_l said G if also G. While basis with minimum cardinality. This study uses literature method observing number before detecting graphs. After obtaini...

the purpose of this study is to investigate the relation between identity styles and commitment with quality of friendship among the students in third grade of high school. 400 participants from nineteen educational districts were chosen randomly. three quesnonnaires were used: identity style inventory, the quality of friendship, the reciprocity of friendship . the results indicated that inform...

Drugs and chemical compounds are often modeled as graphs in which the each vertex of the graph expresses an atom of molecule and covalent bounds between atoms are represented by the edges between their corresponding vertices. The topological indicators defined over this molecular graph have been shown to be strongly correlated to various chemical properties of the compounds. In this article, by...

R. B. Gnanajothi, Topics in graph theory, Ph. D. thesis, Madurai Kamaraj University, India, 1991. E. M. Badr, On the Odd Gracefulness of Cyclic Snakes With Pendant Edges, International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) Vol. 4, No. 4, December 2012. E. M. Badr, M. I. Moussa & K. Kathiresan (2011): Crown graphs and subdivision of l...

Trust Networks are a specific kind of social network where edges in the network have positive and negative signs connoting friendship/trust and antagonism/distrust respectively. While the last few years have seen a rich body of work on generative models for social networks, there hasn’t been much work on understanding in what ways trust networks differ from social networks and to create generat...

We present a systematic examination of real network datasets using maximum likelihood estimation for exponential random graph models as well as new procedures to evaluate how well the models fit the observed graphs. These procedures compare structural statistics of the observed graph with the corresponding statistics on graphs simulated from the fitted model. We apply this approach to the study...

We present a systematic examination of real network datasets using maximum likelihood estimation for exponential random graph models as well as new procedures to evaluate how well the models fit the observed graphs. These procedures compare structural statistics of the observed graph with the corresponding statistics on graphs simulated from the fitted model. We apply this approach to the study...