Results 11 to 20 of about 70 (68)
Confluence number of certain derivative graphs
Acta Universitatis Sapientiae: Informatica, 2021 This paper furthers the study on the confluence number of a graph. In particular results for certain derivative graphs such as the line graph of trees, cactus graphs, linear Jaco graphs and novel graph operations are reported.
Kok Johan, Shiny Joseph
doaj +1 more source
Extremal trees for the Randić index
Acta Universitatis Sapientiae: Mathematica, 2022 Graph theory has applications in various fields due to offering important tools such as topological indices. Among the topological indices, the Randić index is simple and of great importance. The Randić index of a graph 𝒢 can be expressed as R(G)=∑xy∈Y(G)
Jahanbani Akbar +2 more
doaj +1 more source
Proper Rainbow Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path.
Doan Trung Duy, Schiermeyer Ingo
doaj +1 more source
Conflict-Free Vertex Connection Number At Most 3 and Size of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in a vertex-coloured graph is called conflict-free if there is a colour used on exactly one of its vertices. A vertex-coloured graph is said to be conflict-free vertex-connected if any two distinct vertices of the graph are connected by a conflict-
Doan Trung Duy, Schiermeyer Ingo
doaj +1 more source
Spectra of Orders for k-Regular Graphs of Girth g
Discussiones Mathematicae Graph Theory, 2021 A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n ...
Jajcay Robert, Raiman Tom
doaj +1 more source
Some properties of the closed global shadow graphs and their zero forcing number
Acta Universitatis Sapientiae: Informatica, 2022 Zero forcing is one of the dynamic vertex coloring problem. Zero forcing number is the minimum cardinality of the zero forcing sets. This parameter is the upper bound for the maximum nullity. A new class of graph where the maximum nullity is equal to the
Raksha M. R., Dominic Charles
doaj +1 more source
On multigraphic and potentially multigraphic sequences
Acta Universitatis Sapientiae: Informatica, 2017 An r-graph(or a multigraph) is a loopless graph in which no two vertices are joined by more than r edges. An r-complete graph on n vertices, denoted by Kn(r) , is an r-graph on n vertices in which each pair of vertices is joined by exactly r edges. A non-
Pirzada Shariefuddin +2 more
doaj +1 more source
Sampling k-partite graphs with a given degree sequence
Acta Universitatis Sapientiae: Informatica, 2018 The authors in the paper [15] presented an algorithm that generates uniformly all the bipartite realizations and the other algorithm that generates uniformly all the simple bipartite realizations whenever A is a bipartite degree sequence of a simple ...
Kayibi Koko K. +3 more
doaj +1 more source
Tripartite graphs with given degree set
Acta Universitatis Sapientiae: Informatica, 2015 If k ≥ 1, then the global degree set of a k-partite graph G = (V1, V2, . . . , Vk, E) is the set of the distinct degrees of the vertices of G, while if k ≥ 2, then the distributed degree set of G is the family of the k degree sets of the vertices of the ...
Iványi Antal +2 more
doaj +1 more source
On Order Prime Divisor Graphs of Finite Groups
Discussiones Mathematicae - General Algebra and Applications, 2021 The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K. +2 more
doaj +1 more source