Results 21 to 30 of about 73 (73)
A regular graph of girth 6 and valency 11
International Journal of Mathematics and Mathematical Sciences, Volume 9, Issue 3, Page 561-565, 1986., 1986 Let f(11, 6) be the number of vertices of an (11, 6)‐cage. By giving a regular graph of girth 6 and valency 11, we show that f(11, 6) ≤ 240. This is the best known upper bound for f(11, 6).
P. K. Wong
wiley +1 more source
A note on the problem of finding a (3, 9)‐cage
International Journal of Mathematics and Mathematical Sciences, Volume 8, Issue 4, Page 817-820, 1985., 1985 In this paper, we discuss The poblem of finding a (3, 9)‐cage. A hamiltonian graph with girth 9 and 54 vertices is given. Except four vertices, each of the remaining vertices of this graph has valency Three. This graph is obtained with the aid of a computer.
P. K. Wong
wiley +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 5, Issue 3, Page 553-564, 1982., 1982 A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian. In this paper, we consider the related notion of a subsemi‐eulerian graph, i.e.
Charles Suffel +3 more
wiley +1 more source
Maximal Independent Sets In Graphs With At Most r Cycles
, 2005 Key Words: cycle, ear decomposition, maximal independent set AMS classification: Primary 05C35; Secondary 05C38, 05C69. We find the maximum number of maximal independent sets in two families of graphs.
Vincent R. Vatter +11 more
core +1 more source
A Sharp Upper Bound on Algebraic Connectivity Using Domination Number [PDF]
, 2020 Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S ...
D Stevanović, P Hansen, M Aouchiche
core
On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees
Journal of Mathematics, Volume 2025, Issue 1, 2025.Nowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class of all fixed‐order chemical trees with a particular number of segments for α > 1, where χα is the ...
Muzamil Hanif +5 more
wiley +1 more source
Journal of Mathematics, Volume 2025, Issue 1, 2025.In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami +3 more
wiley +1 more source
The Binding Number of a Zero Divisor Graph [PDF]
, 2013 In this paper, we evaluate b(Γ(Z n )). Our main result is, we give maximum value of b(Γ(Z n )) is 0.99999999796427626489236243072661, where n is any positive integer upto fiftieth million.
J Ravi Sankar +3 more
core
Detour index of a class of unicyclic graphs
, 2010 The detour index of a connected graph is defined as the sum of detour distances between all unordered pairs of vertices. We determine the n-vertex unicyclic graphs whose vertices on its unique cycle all have degree at least three with the first, the ...
Qi Xuli, Bo Zhou
core +1 more source
Sequences of Maximal Degree Vertices in Graphs [PDF]
, 2004 2000 Mathematics Subject Classification: 05C35.Let Γ(M ) where M ⊂ V (G) be the set of all vertices of the graph G adjacent to any vertex of M. If v1, . . . , vr is a vertex sequence in G such that Γ(v1, . . . , vr ) = ∅ and vi is a maximal degree vertex
Khadzhiivanov, Nickolay, Nenov, Nedyalko
core