An almost self-centered graph is a connected of order $n$ with exactly $n-2$ central vertices, and an peripheral $n-1$ vertices. We determine (1) the maximum girth $n$; (2) independence number radius $r$; (3) minimum $k$-regular graph; (4) size (5) possible degrees (6) vertices degree in $n-4$ which second largest possible. Whenever extremal graphs have neat form, we also describe them.

Background: As for high prevalence and incidence of heart failure, it can impose huge health, economic, and social burden on society. Education and self-care are important aspects of management in patients with heart failure, which can control the disease complications. This study aimed to investigate the effect of family-centered education approach on self-care behaviors of the patients wi...

For a nonempty set S of vertices in a strong digraph D, the strong distance d(S) is the minimum size of a strong subdigraph of D containing the vertices of S. If S contains k vertices, then d(S) is referred to as the k-strong distance of S. For an integer k > 2 and a vertex v of a strong digraph D, the k-strong eccentricity sek(v) of v is the maximum k-strong distance d(S) among all sets S of k...

objective: to compare the effectiveness of rational, behavioral and emotive therapy (rebt) and person-centered therapy (pct) on self-differentiation and intimacy among divorce clients. methods: in quasi-experimental study, 42 divorce clients (both males and females) who presented to the counsling center of sanandaj, iran were sampled. they were categorized into three groups of pct, rebt, and co...

We use data from a study of finding paths through three different graph depictions: node-link, centered matrix, and quilts to explore how time to solve is influenced by the graph structure: number of nodes, links, skips or layers. We use regressions to determine the influence of these attributes on pathfinding time across depictions. Furthering this idea, we begin to explore how individual user...