Results 41 to 50 of about 605,731 (305)
A Note on the Maximum Genus of Graphs with Diameter 4 [PDF]
, 2007 Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order ...
WeiLi, He, Xiang, Ren, Lin, Zhao
core +1 more source
An advance in infinite graph models for the analysis of transportation networks
International Journal of Applied Mathematics and Computer Science, 2016 This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
Extremal graphs of multiplicative sum Zagreb index [PDF]
Notes on Number Theory and Discrete MathematicsThe multiplicative sum Zagreb index, regarded as the multiplicative version of the first Zagreb index, is defined as the product of the degree sum over all pairs of adjacent vertices.
Chunlei Xu +3 more
doaj +1 more source
The Upper Monophonic Number of a Graph [PDF]
, 2010 An article about Smarandachely k-monophonic path, and Smarandachely k-monophonic ...
Panchali, S., John, J.
core +1 more source
Proofs by Transformation in Extremal Graph Theory [PDF]
, 2022 A graph is a mathematical model representing binary relationships between elements of a set. It is composed of two sets: the set of the elements called the vertices and a set of pairs of vertices called the edges.
Devillez, Gauvain
core +1 more source
Maximal tree and unicylic graph for Euler Sombor index with given diameter
AKCE International Journal of Graphs and CombinatoricsThe study of topological descriptors is essential for understanding the underlying structures of graphs and networks. Numerous numerical descriptors associated with graphs have been used to analyze their overall structure.
Zahid Raza +3 more
doaj +1 more source
P_{m}-saturated graphs with minimum size [PDF]
Opuscula Mathematica, 2004 By \(P_m\) we denote a path of order \(m\). A graph \(G\) is said to be \(P_m\)-saturated if \(G\) has no subgraph isomorphic to \(P_m\) and adding any new edge to \(G\) creates a \(P_m\) in \(G\). In 1986 L. Kászonyi and Zs.
Aneta Dudek, A. Paweł Wojda
doaj
Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
Discrete Dynamics in Nature and Society, 2020 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices.
Gai-Xiang Cai, Xing-Xing Li, Gui-Dong Yu
doaj +1 more source
Some Bond Incident Degree Indices of (Molecular) Graphs with Fixed Order and Number of Cut Vertices
Discrete Dynamics in Nature and Society, 2021 A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetric function. The choice fdGu,dGv=adGu+adGv in the aforementioned formula
Abeer M. Albalahi +3 more
doaj +1 more source
Unicyclic Graphs with the Fourth Extremal Wiener Indices
Journal of Chemistry, 2020 A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourth extremal Wiener indices are characterized. It is shown that, among all unicyclic graphs with n≥8 vertices, C5Sn−4 and C2u1,u2S3,Sn−4 attain the fourth ...
Guangfu Wang +3 more
doaj +1 more source