Results 41 to 50 of about 1,099 (89)
A majorization method for localizing graph topological indices
, 2011 This paper presents a unified approach for localizing some relevant graph topological indices via majorization techniques. Through this method, old and new bounds are derived and numerical examples are provided, showing how former results in the ...
Alderson +34 more
core +1 more source
On the maximal Aa -index of graphs with a prescribed number of edges
Special MatricesFor any real number α∈[0,1]\alpha \in \left[\mathrm{0,1}], by the Aα{A}_{\alpha }-matrix of a graph GG, we mean the matrix Aα(G)=αD(G)+(1−α)A(G){A}_{\alpha }\left(G)=\alpha D\left(G)+\left(1-\alpha )A\left(G), where A(G)A\left(G) and D(G)D\left(G) are ...
Chang Ting-Chung, Tam Bit-Shun
doaj +1 more source
Hamiltonian and Pancyclic Graphs in the Class of Self-Centered Graphs with Radius Two
Discussiones Mathematicae Graph Theory, 2018 The paper deals with Hamiltonian and pancyclic graphs in the class of all self-centered graphs of radius 2. For both of the two considered classes of graphs we have done the following. For a given number n of vertices, we have found an upper bound of the
Hrnčiar Pavel, Monoszová Gabriela
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
On minimum degree conditions for supereulerian graphs [PDF]
, 1999 A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \subseteq E (G)$ with $|E| \le 3$ satisfies the property that each component of $G-E$ has order at ...
Broersma, H.J., Xiong, L.
core +2 more sources
Random algebraic construction of extremal graphs [PDF]
, 2015 In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.Comment: 8 ...
Bukh, Boris
core
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and . Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2023 Let H = (V, E) be a hypergraph, where V is a set of vertices and E is a set of non-empty subsets of V called edges. If all edges of H have the same cardinality r, then H is an r-uniform hypergraph; if E consists of all r-subsets of V, then H is a ...
Tian Yingzhi +3 more
doaj +1 more source
Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number [PDF]
, 2012 In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized.
Abraham Berman +5 more
core
Mantel's Theorem for random graphs [PDF]
, 2012 For a graph $G$, denote by $t(G)$ (resp. $b(G)$) the maximum size of a triangle-free (resp. bipartite) subgraph of $G$. Of course $t(G) \geq b(G)$ for any $G$, and a classic result of Mantel from 1907 (the first case of Tur\'an's Theorem) says that ...
DeMarco, Bobby, Kahn, Jeff
core