نتایج جستجو برای: types of graphs
تعداد نتایج: 21183499 فیلتر نتایج به سال:
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
Abstract Fuzzy set and neutrosophic are two efficient tools to handle the uncertainties vagueness of any real-world problems. Neutrosophic is more capable than fuzzy deal a real-life problem. This research paper introduces some new concept single-valued graph (SVNG). We have also presented different operations on SVNG such as rejection, symmetric difference, maximal product, residue product wit...
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...
the total version of geometric–arithmetic index of graphs is introduced based on the endvertexdegrees of edges of their total graphs. in this paper, beside of computing the total gaindex for some graphs, its some properties especially lower and upper bounds are obtained.
چکیده پژوهش شبه تجربی حاضر به بررسی بکارگیری تمارین کلاسی که برانگیزنده آگاهی و توجه آگاهانه به همایندها بعنوان بخشی از یک دوره ی مکالمه زبان خارجی در یکی از آموزشگاه های زبان انگلیسی ایران است می پردازد.
a graph that contains a hamiltonian cycle is called a hamiltonian graph. in this paper wecompute the first and the second geometric – arithmetic indices of hamiltonian graphs. thenwe apply our results to obtain some bounds for fullerene.
a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید