ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Computing
Architecture and Urbanism
Computing
Literature
Social Sciences
Languages
Research
all records (76)

Languages
English
Spanish
German
Portuguese
French
Finnish

Countries
Indonesia
USA
Australia
Brazil
Ukraine
Italy
Chile
South Africa
Canada
Spain
all records (79)

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

Filter  
 
10.536  Articles
1 of 1.055 pages  |  10  records  |  more records»
Let G be a graph with p vertices and q edges and A = {1, 3, ..., q} if q is odd or A = {1, 3, ..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : V (G) ? A that induces an edge l... see more

Let G be a graph with p vertices and q edges and A = {0,2,4,···, q+1} if q is odd or A = {0,2,4,···,q} if q is even. A graph G is said to be an even vertex equitable even labeling if there exists a vertex labeling f : V (G) ? A that induces an edge labeli... see more

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

In this paper, we introduce a new labeling called odd vertex equitable even labeling. Let G be a graph with p vertices and q edges and A = {1, 3,..., q} if q is odd or A = {1, 3,..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable ... see more

Let G be a graph with p vértices and q edges and A = {0,1, 2,..., [q/2]}. A vertex labeling f : V(G) ? A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ? A, let vf (a) be the number of vertices v with f (... 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

In this paper, the vertex-degree function index Hf(G) is considered when function f(x) belongs to four classes of functions determined by the following properties: strictly convex versus strictly concave and strictly increasing versus ... see more

Let G=(V,E)G=(V,E) be a graph. If GG is a König graph or if GG is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ?G\Delta_{G} is pure shellable, R/I?R/I_{\Delta} is Cohen-Macaulay, GG is unmixed vertex decomp... see more

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interes... see more

1 of 1.055 pages  |  10  records  |  more records»