ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Agronomy and forestry
Computing
Education
Biology
Computing
Research
Economy
Social Sciences
all records (75)

Languages
English
Spanish
German
Portuguese
French

Countries
Indonesia
Australia
USA
Brazil
Chile
Ukraine
Italy
Denmark
Romania
South Africa
all records (69)

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

Filter  
 
5.484  Articles
1 of 549 pages  |  10  records  |  more records»
A set W is called a local resolving set of G if the distance of u and v to some elements of W are distinct for every two adjacent vertices u and v in G.  The local metric dimension of G is the minimum cardinality of a local resolving set of G.  ... see more

A set D - V is a dominating set of G if every vertex in V - D is adjacent to some vertex in D. The dominating number ?(G) of G is the minimum cardinality of a dominating set D. A dominating set D of a graph G = (V;E) is a split dominating set if... see more

A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1. In this pa... see more

For any non-abelian group G, the non-commuting graph of G, G=GG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and o... see more

A dominating set D of a graph G = (V;E) is a split dominating set ifthe induced graph hV ?? Di is disconnected. The split domination number s(G)is the minimum cardinality of a split domination set. A graph G is called vertexsplit domination critical if s(... see more

Among the varius coloring of graphs, the concept of equitable total coloring of graph G is the coloring of all its vertices and edges in which the number of elements in any two color classes differ by atmost one. The minimum number of colors required is c... see more

During the last decades, different types of decompositions have been processed in the field of graph theory. In various problems, for example in the construction of recognition algorithms, frequently appears the so-called weakly decomposition of graphs.Po... see more

A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to Bína and Pribil (2015), Cheng, C... see more

Let D\mathcal{D} be a weighted oriented graph and I(D)I(\mathcal{D}) be its edge ideal. In this paper, we investigate the Betti numbers of I(D)I(\mathcal{D}) via upper-Koszul simplicial complexes, Betti splittings and the mapping cone construction. In par... see more

1 of 549 pages  |  10  records  |  more records»