ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Literature
Technology
Mathematics
Research
Biology
Languages
Public health
Agronomy and forestry
all records (75)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
USA
Brazil
Spain
Italy
Australia
Vietnam
Ukraine
Turkey, Turkish Republic
Argentina
all records (80)

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

Filter  
 
168.093  Articles
1 of 16.810 pages  |  10  records  |  more records»
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

In this work, we define Interval-valued Fermatean neutrosophic graphs and present some operations on Interval-valued Fermatean neutrosophic graphs. Further, we introduce the concepts of Regular interval-valued Fermatean neutrosophic graphs, Strong interva... see more

In this work, we define Interval-valued Fermatean neutrosophic graphs and present some operations on Interval-valued Fermatean neutrosophic graphs. Further, we introduce the concepts of Regular interval-valued Fermatean neutrosophic graphs, Strong interva... 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

Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the d... see more

Let G and H be two given graphs. The notation F?(G,H) means that any red-blue coloring on the edges of F will create either a red subgraph G or a blue subgraph H in F. A graph F is a Ramsey (G,H)-minimal graph if F satisfies two conditions: (1) F?(G,H), a... 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

The search for the smallest possible dd-regular graph of girth gg has a long history, and is usually known as the cage problem. This problem has a natural extension to hypergraphs, where we may ask for the smallest number of vertices in a dd-regular, rr-u... see more

For a field F\mathbb{F} and functions f,g,h,j:F?Ff,g,h,j\colon\mathbb{F}\to \mathbb{F}, we define GF(f(X)h(Y),g(X)j(Y))\Gamma_\mathbb{F}(f(X)h(Y),g(X) j(Y)) to be a bipartite graph where each partite set is a copy of F3\mathbb{F}^3, and a vertex (a,a2,a3)... see more

1 of 16.810 pages  |  10  records  |  more records»