ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Languages
Research
Technology
Literature
Biology
Economy
Pure sciences
Mathematics
all records (76)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Brazil
Ukraine
South Africa
Poland
Canada
Spain
Russia
Italy
all records (79)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
21.248  Articles
1 of 2.126 pages  |  10  records  |  more records»
A subset D ? V(G) is called an equitable dominating set of a graph G if every vertex v ? V(G) \ D has a neighbor u ? D such that |dG(u)-dG(v)| = 1. An equitable dominating set D is a degree equitable restrained double dominating set (D... see more

A subset D of V is called an equitable dominating set if for every v G V — D there exists a vertex u G D such that uv G E(G) and \d(u) — d(v)\ < 1,where d(u) denotes the degree of vertex u and d(v) denotes the degree of vertex v. The minimum cardinalit... see more

?An outer-independent Italian dominating function (OIIDF) on a graph G is a function f : V(G)?{0, 1, 2} such that every vertex v ? V(G) with f(v)=0 has at least two neighbors assigned 1 under f o... see more

The zeroth-order general Randic index of a graph G is defined as Ra(G)=?v ? V(G)dGa(v), where a ? R, V(G) is the vertex set of G and dG(v) is the degree of a vertex v in G. We obtain bounds ... see more

In a connected graph G = (V,E), a set D ? V is a connected dominating set if for every vertex v ? V \ D, there exists u ? D such that u and v are adjacent, and the subgraphinduced by D in G is connected. A connected dominating ... see more

Th. W. Adorno’s aesthetics represents a comprehensive reflection on a number of important topics in aesthetic research. Among them is the issue of the aesthetic experience generated by the beauty of nature. In the perspective of Adorno’s theory, the exper... see more

The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the inequality b(G) = 2s - 2, provided G has degree s vertices.... see more

In [J. Graph Theory 13 (1989) 749—762], McCuaig and Shepherd gave an upper bound of the domination number for connected graphs with minimum degree at least two. In this paper, we propose a simple strategy which, together with the McCuaig-Shepherd the... see more

Author Nawal el-Saadawi is a feminist from Cairo, Egypt whose work focuses on women in Islam. After El-Saadawi obtained his medical degree at Cairo University in 1955. El-Saadawi through his medical practice, he observed physical and psychological problem... see more

1 of 2.126 pages  |  10  records  |  more records»