Results 41 to 50 of about 5,409,269 (206)
Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
Fokus, 2016 This research aims to observes panning tree number of complete bipartite graph (Km,n) by matrix-tree theorem.This research was using library research method which the step are:(1)Drawing complete bipartite graph (Km,n) where m= 1,2,3,4,and; (2)Determinin
Novia Rahmawati
doaj +1 more source
On the r-dynamic coloring of subdivision-edge coronas of a path
AIMS Mathematics, 2020 This paper deals with the r-dynamic chromatic number of the subdivision-edge corona of a path and exactly one of the following nine types of graphs: a path, a cycle, a wheel, a complete graph, a complete bipartite graph, a star, a double star, a fan ...
G. Nandini +2 more
doaj +1 more source
The complete classification of unital graph C∗-algebras: Geometric and strong [PDF]
Duke mathematical journal, 2016 We provide a complete classification of the class of unital graph $C^*$-algebras - prominently containing the full family of Cuntz-Krieger algebras - showing that Morita equivalence in this case is determined by ordered, filtered $K$-theory.
S. Eilers +3 more
semanticscholar +1 more source
Joint Spectral Radius and Path-Complete Graph Lyapunov Functions [PDF]
SIAM Journal of Control and Optimization, 2011 We introduce the framework of path-complete graph Lyapunov functions for ap- proximation of the joint spectral radius. The approach is based on the analysis of the underlying switched system via inequalities imposed among multiple Lyapunov functions ...
Amir Ali Ahmadi +3 more
semanticscholar +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
Statistical Properties of SIS Processes with Heterogeneous Nodal Recovery Rates in Networks
Applied SciencesThe modeling and analysis of epidemic processes in networks have attracted much attention over the past few decades. A major underlying assumption is that the recovery process and infection process are homogeneous, allowing the associated theoretical ...
Dongchao Guo, Libo Jiao, Wendi Feng
doaj +1 more source
Edge-maximal -free non-bipartite Hamiltonian graphs of odd order
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] denote the class of non-bipartite graphs on n vertices containing no [Formula: see text]-graph and [Formula: see text] Let [Formula: see text] denote the class of non-bipartite Hamiltonian graphs on n vertices containing no ...
M. M. M. Jaradat +4 more
doaj +1 more source
The Reliability of a Class of Two-Layer Networks with Unreliable Edges
AxiomsIt is well known that networks are dynamic graphs, and the topology of a network can be described by a graph. Thus, the reliability of a network under edge failure is defined as the probability that its corresponding topological graph remains connected ...
Sun Xie, Haixing Zhao, Jun Yin
doaj +1 more source
IEEE Access, 2018 In this paper, we have proposed altogether different and new approaches for the computation of all possible spanning trees of a simple, undirected, and connected graph.
Maumita Chakraborty +2 more
doaj +1 more source
Hamiltonian Complete Number of Some Variants of Caterpillar Graphs [PDF]
, 2022 Adefokun, TAyo Charles +3 more
openalex +1 more source