Results 1 to 10 of about 298 (175)
On Minimum Generalized Degree Distance Index of Cyclic Graphs
International Journal of Mathematics and Mathematical Sciences, 2023 Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan +3 more
doaj +1 more source
AN ISOMORPHISM THEOREM FOR UNICYCLIC GRAPHS
Demonstratio Mathematica, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 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.
openaire +1 more source
The Harary Index of All Unicyclic Graphs with Given Diameter
Discrete Dynamics in Nature and Society, 2018 The Harary index of G is the sum of reciprocals of distance between any two vertices in G. In this paper, we obtain the graphs with the maximum and second-maximum Harary indices among n-vertex unicyclic graphs with diameter d.
Bao-Hua Xing +3 more
doaj +1 more source
Degree distance of unicyclic graphs
Filomat, 2010 The degree distance of a connected graph G with vertex set V(G) is defined as D'(G)= ?u?V (G) dG (u)DG (u), where dG (u) denotes the degree of vertex u and DG (u) denotes the sum of distances between u and all vertices of G. We determine the maximum degree distance of n-vertex unicyclic graphs with given maximum degree, and the first seven maximum ...
Zhibin Du, Bo Zhou
openaire +2 more sources
Locating eigenvalues of unicyclic graphs
Applicable Analysis and Discrete Mathematics, 2017 We present a linear time algorithm that computes the number of eigenvalues of a unicyclic graph in a given real interval. It operates directly on the graph, so that the matrix is not needed explicitly. The algorithm is applied to study the multiplicities of eigenvalues of closed caterpillars, obtain the spectrum of balanced closed ...
Braga, Rodrigo O. +2 more
openaire +2 more sources
Graphs which have pancyclic complements
International Journal of Mathematics and Mathematical Sciences, 1978 Let p and q denote the number of vertices and edges of a graph G, respectively. Let Δ(G) denote the maximum degree of G, and G¯ the complement of G. A graph G of order p is said to be pancyclic if G contains a cycle of each length n, 3≤n≤p.
H. Joseph Straight
doaj +1 more source
Indonesian Journal of Combinatorics, 2020 In a quite general sense, additive vertex labelings are those functions that assign nonnegative integers to the vertices of a graph and the weight of each edge is obtained by adding the labels of its end-vertices.
Christian Barrientos
doaj +1 more source
Restrained domination in unicyclic graphs
Discussiones Mathematicae Graph Theory, 2009 Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the minimum cardinality of a restrained dominating set of G. A unicyclic graph is a connected graph that contains precisely one cycle.
Johannes H. Hattingh +4 more
openaire +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