نتایج جستجو برای: centered graph

تعداد نتایج: 246050  

Journal: :پژوهش های روانشناسی بالینی و مشاوره 0
خالق خواه خالق خواه مسعودی مسعودی

one of the subjects which have long been obsessing the minds and spirits of deep-thinking believers is the relationship between religion in all aspects and scopes we can consider for it and the model of reason and rationality. the scope of religious studies is full of various and ever-emerging questions in this regard. there are diverse approaches to the relation between these two. adopting eac...

Journal: :مجله تغییر فرهنگی-اجتماعی 0
mahmoud sharepour mohammad fazeli elaheh eghrarian

social capital has received considerable attention in all branches of social sciences, and has recently been the focus in the field to explain about procreator elements. trust is one of the social capital elements and plays an important role in specifying consequences incidental to social capital. nearly two decades ago, robert putnam proposed an explanation of trust relying on associational li...

2014
S. Narmatha K. Janani

A social networking service is an online service, platform, or site that focuses on facilitating the building of social networks or social relations among people who, for example, share interests, activities, backgrounds, or reallife connections. A social network service consists of a representation of each user, his/her social links, and a variety of additional services. Most social network se...

Journal: :Complex & Intelligent Systems 2023

Abstract User preference information plays an important role in knowledge graph-based recommender systems, which is reflected users having different preferences for each entity–relation pair the graph. Existing approaches have not modeled this fine-grained user feature well, as affecting performance of systems. In paper, we propose a deep preference-aware reinforcement learning network (KPRLN) ...

Journal: :transactions on combinatorics 2014
mostafa tavakoli f. rahbarnia m. mirzavaziri a. r. ashrafi

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

2012
M. Lafourcade

Let us assume we are given a linearly uncountable, holomorphic ideal acting almost everywhere on an ultra-arithmetic graph rK. Recent developments in rational PDE [10] have raised the question of whether D < −1. We show that ξ ≥ F . In this setting, the ability to study dependent, Markov– Russell curves is essential. Recent interest in systems has centered on computing covariant, partially nonn...

Journal: :algebraic structures and their applications 0
hamid reza dorbidi university of jiroft

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

Journal: :iranian journal of mathematical chemistry 2013
m. tavakoli f. rahbarnia

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

Journal: :iranian journal of nursing and midwifery research 0
mitra zolfaghari parvaneh asgari fatemeh bahramnezhad sajad ahmadirad hamid haghani

abstract background: hypotension and muscular cramp are the common complications of hemodialysis. effective control of hemodialysis complications increases the survival time and the quality of life of patients on hemodialysis. considering that failure to follow a therapeutic plan is one of the most prevalent causes of hemodialysis complications, the present research was conducted to study the e...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید