<p>A graph denoted by is a pair of where non-empty set vertices in G, and E edges G. In theory, there are various types graphs including star graphs, cycle graph, wheel graph. Graph operations on two or more can produce new graphs. Amalgamation one the Suppose connected amalgamating 1 2 joining obtained joins vertex into , common resulting from while edge combining g, g side (

let g be a (p, q) graph. let k be an integer with 2 ≤ k ≤ p and f from v (g) to the set {1, 2, . . . , k} be a map. for each edge uv, assign the label |f(u) − f(v)|. the function f is called a k-difference cordial labeling of g if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...

A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...

Sena-Graph syrup has recently been formulated by an Iranian pharmaceutical company for being used in bowel evacuation before radiography, colonoscopy and surgery. This study compares the efficacy, adverse effects and patient compliance of two bowel preparation regimens with castor oil and Sena-Graph syrup in of outpatients for Intravenous Urography (IVU). One hundred and fourteen consecutive ou...

‎In this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay‎. ‎It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

 In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

The total graph is built by joining the to its line means of incidences. We introduce a similar construction for signed graphs. Under two defnitions graph, we defne corresponding and show that it stable under switching. consider balance, frustration index number, largesteigenvalue. In regular case compute spectrum adjacency matrix spectra certain compositions, determine some with exactly main e...

To a simple graph we associate so-called series, which can be viewed as the Hilbert–Poincaré series of certain infinite jet scheme. We study new q-representations and examine modular properties several examples including Dynkin diagrams finite affine type. Notably, obtain formulas for type A7 A8 in terms “sum tails” D4 D5 form indefinite theta functions signature (1,1). also related to sums pow...