Results 11 to 20 of about 1,962 (215)
CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES
Barekeng, 2023 A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same.
Aditya Ambarwati, Vira Hari Krisnawati
doaj +3 more sources
Discrete Mathematics, 2008 Let \(\lambda_2\) be the second largest eigenvalue of the adjacency matrix of a graph. Graphs having \(\lambda_2\leq 2\) are called reflexive graphs. Since this property is hereditary, these graphs may be represented through sets of maximal graphs. In this paper, authors continue their previous line of study and construct maximal bicyclic reflexive ...
Zoran Radosavljevic +2 more
openaire +2 more sources
The first Dirichlet eigenvalue of bicyclic graphs [PDF]
Czechoslovak Mathematical Journal, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Guang-Jun, Zhang, Xiao-Dong
openaire +3 more sources
Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
Journal of Chemistry, 2021 A connected graph GV,E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set ...
Muhammad Rizwan +3 more
doaj +2 more sources
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
Journal of Inequalities and Applications, 2016 Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest Laplacian eigenvalues of G. In this paper, we determine the bicyclic graph with maximum S 2 ( G ) $S_{2}(G)$ among all bicyclic graphs of order n, which confirms the
Yirong Zheng +3 more
doaj +2 more sources
Regularity of bicyclic graphs and their powers [PDF]
Journal of Algebra and Its Applications, 2019 Let [Formula: see text] be the edge ideal of a bicyclic graph [Formula: see text] with a dumbbell as the base graph. In this paper, we characterize the Castelnuovo–Mumford regularity of [Formula: see text] in terms of the induced matching number of [Formula: see text]. For the base case of this family of graphs, i.e.
Cid-Ruiz, Yairon +3 more
openaire +5 more sources
On the nullity of bicyclic graphs
Linear Algebra and its Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Shengbiao +2 more
openaire +3 more sources
On minimum algebraic connectivity of graphs whose complements are bicyclic
Open Mathematics, 2019 The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao +3 more
doaj +2 more sources
LOCAL IRREGULARITY VERTEX COLORING OF BICYCLIC GRAPH FAMILIES
BarekengThe graph in this research is a simple and connected graph with as vertex set and as an edge set. We used deductive axiomatic and pattern recognition method.
Arika Indah Kristiana +5 more
doaj +3 more sources
Unicyclic graphs with bicyclic inverses [PDF]
Czechoslovak Mathematical Journal, 2017 A graph is nonsingular if its adjacency matrix A(G) is nonsingular. The inverse of a nonsingular graph G is a graph whose adjacency matrix is similar to A(G)−1 via a particular type of similarity. Let H denote the class of connected bipartite graphs with unique perfect matchings.
Panda, Swarup Kumar
core +3 more sources