Results 101 to 110 of about 412,655 (203)
The Least Algebraic Connectivity of Graphs
Discrete Dynamics in Nature and Society, 2015 The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected.
Guisheng Jiang, Guidong Yu, Jinde Cao
doaj +1 more source
Greedoids on Vertex Sets of Unicycle Graphs
CoRR, 2009 9 pages; 4 ...
Vadim E. Levit, Eugen Mandrescu
openaire +3 more sources
Gracefulness of unicyclic graphs
, 2015 С использованием конструктивных и аналитических методов решается задача существования грациозной разметки для одноциклических графов. Доказана грациозность некоторых представителей этого класса графов.Із застосуванням конструктивних та аналітичних ...
Семенюта, М.Ф.
core
On Unicyclic Ramsey (mK2, P3)−Minimal Graphs [PDF]
, 2015 Ramsey minimal graph is one of growing topics in Ramsey theory. The search of Ramsey minimal graphs for a combination of graphs G and H is an interesting and difficult problem.
Baskoro, Edy Tri +3 more
core +1 more source
Factorizations of complete graphs into tadpoles
AKCE International Journal of Graphs and Combinatorics, 2020 A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing a terminal vertex of the path to an arbitrary vertex of the cycle.
Michael Kubesa, Tom Raiman
doaj +1 more source
, 2020 In the study of topological indices two negative correlations are well known: that between the number of subtrees and the Wiener index (sum of distances), and that between the Merrifield-Simmons index (number of independent vertex subsets) and the Hosoya index (number of independent edge subsets).
Andriantiana, Eric Ould Dadah, Wang, Hua
openaire +2 more sources
Degree distance of unicyclic and bicyclic graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilic +4 more
openaire +1 more source
The Connected Detour Numbers of Special Classes of Connected Graphs
Journal of Mathematics, 2019 Simple finite connected graphs G=V,E of p≥2 vertices are considered in this paper. A connected detour set of G is defined as a subset S⊆V such that the induced subgraph GS is connected and every vertex of G lies on a u−v detour for some u,v∈S.
Ahmed M. Ali, Ali A. Ali
doaj +1 more source
Solutions of Detour Distance Graph Equations. [PDF]
Sensors (Basel), 2022 Prabha SC +7 more
europepmc +1 more source
The determinant of a unicyclic graph’s neighborhood matrix
Linear Algebra and its Applications, 2005 Let \(G\) be a unicyclic graph with \(n\) vertices and a unique cycle, \(A(G)\) denotes the adjacency matrix of the graph \(G\). The algorithm for computing the determinant function of the matrix \(\alpha I_n+A(G)\) which uses \(O(n)\) arithmetic operations under some restrictions on the degrees of the vertices of the graph \(G\) is obtained. Among the
openaire +2 more sources