scholarly journals Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Wenjie Ning ◽  
Kun Wang ◽  
Hassan Raza
Keyword(s):  
Connected Graph ◽  
Maximum Degree ◽  
Effective Resistance ◽  
Resistance Distance ◽  
Bicyclic Graph ◽  
Degree Of A Vertex ◽  
Bicyclic Graphs

Let G = V , E be a connected graph. The resistance distance between two vertices u and v in G , denoted by R G u , v , is the effective resistance between them if each edge of G is assumed to be a unit resistor. The degree resistance distance of G is defined as D R G = ∑ u , v ⊆ V G d G u + d G v R G u , v , where d G u is the degree of a vertex u in G and R G u , v is the resistance distance between u and v in G . A bicyclic graph is a connected graph G = V , E with E = V + 1 . This paper completely characterizes the graphs with the second-maximum and third-maximum degree resistance distance among all bicyclic graphs with n ≥ 6 vertices.

Maximum total irregularity index of some families of graph with maximum degree n − 1

2021 ◽  
pp. 2250069
Author(s):  
Shamaila Yousaf ◽  
Akhlaq Ahmad Bhatti
Keyword(s):  
Maximum Degree ◽  
Discrete Math ◽  
Simple Approach ◽  
Unicyclic Graphs ◽  
Irregularity Index ◽  
Degree Of A Vertex ◽  
Tricyclic Graphs ◽  
Bicyclic Graphs ◽  
Appl Math

The total irregularity index of a graph [Formula: see text] is defined by Abdo et al. [H. Abdo, S. Brandt and D. Dimitrov, The total irregularity of a graph, Discrete Math. Theor. Comput. Sci. 16 (2014) 201–206] as [Formula: see text], where [Formula: see text] denotes the degree of a vertex [Formula: see text]. In 2014, You et al. [L. H. You, J. S. Yang and Z. F. You, The maximal total irregularity of unicyclic graphs, Ars Comb. 114 (2014) 153–160.] characterized the graph having maximum [Formula: see text] value among all elements of the class [Formula: see text] (Unicyclic graphs) and Zhou et al. [L. H. You, J. S. Yang, Y. X. Zhu and Z. F. You, The maximal total irregularity of bicyclic graphs, J. Appl. Math. 2014 (2014) 785084, http://dx.doi.org/10.1155/2014/785084 ] characterized the graph having maximum [Formula: see text] value among all elements of the class [Formula: see text] (Bicyclic graphs). In this paper, we characterize the aforementioned graphs with an alternative but comparatively simple approach. Also, we characterized the graphs having maximum [Formula: see text] value among the classes [Formula: see text] (Tricyclic graphs), [Formula: see text] (Tetracyclic graphs), [Formula: see text] (Pentacyclic graphs) and [Formula: see text] (Hexacyclic graphs).

Sharp upper bounds of F-index among bicyclic graphs

2021 ◽  
pp. 2250055
Author(s):  
R. Khoeilar ◽  
A. Jahanbani ◽  
L. Shahbazi ◽  
J. Rodríguez
Keyword(s):  
Maximum Degree ◽  
Topological Index ◽  
Upper Bounds ◽  
Degree Of A Vertex ◽  
Bicyclic Graphs

The [Formula: see text]-index of a graph [Formula: see text], denoted by [Formula: see text], is defined as the sum of weights [Formula: see text] over all edges [Formula: see text] of [Formula: see text], where [Formula: see text] denotes the degree of a vertex [Formula: see text]. In this paper, we give sharp upper bounds of the [Formula: see text]-index (forgotten topological index) over bicyclic graphs, in terms of the order and maximum degree.

scholarly journals Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Gaixiang Cai ◽  
Xing-Xing Li ◽  
Guidong Yu
Keyword(s):  
Connected Graph ◽  
Extremal Graph ◽  
Resistance Distance ◽  
Bicyclic Graphs

The reciprocal degree resistance distance index of a connected graph G is defined as RDR G = ∑ u , v ⊆ V G d G u + d G v / r G u , v , where r G u , v is the resistance distance between vertices u and v in G . Let ℬ n denote the set of bicyclic graphs without common edges and with n vertices. We study the graph with the maximum reciprocal degree resistance distance index among all graphs in ℬ n and characterize the corresponding extremal graph.

scholarly journals The first two cacti with larger multiplicative eccentricity resistance-distance

Filomat ◽  
2019 ◽  
Vol 33 (6) ◽  
pp. 1783-1800
Author(s):  
Yunchao Hong ◽  
Zhongxun Zhu
Keyword(s):  
Connected Graph ◽  
Effective Resistance ◽  
Extremal Graphs ◽  
Resistance Distance ◽  
G Value

For a connected graph G, the multiplicative eccentricity resistance-distance ?*R(G) is defined as ?*R(G) = ?{x,y}?V(G)?(x)??(y)RG(x,y), where ?(?) is the eccentricity of the corresponding vertex and RG(x,y) is the effective resistance between vertices x and y. A cactus is a connected graph in which any two simple cycles have at most one vertex in common. Let Cat(n;t) be the set of cacti possessing n vertices and t cycles, where 0 ? t ? n-1/2. In this paper, we first introduce some edge-grafting transformations which will increase ?*R(G). As their applications, the extremal graphs with maximum and second-maximum ?*R(G)-value in Cat(n,t) are characterized, respectively.

scholarly journals Resistance Distances in Linear Polyacene Graphs

2021 ◽  
Vol 8 ◽  
Author(s):  
Dayong Wang ◽  
Yujun Yang
Keyword(s):  
Connected Graph ◽  
Exact Expression ◽  
Effective Resistance ◽  
Electrical Network ◽  
Combinatorial Approach ◽  
Network Approach ◽  
Resistance Distance ◽  
Electric Network

The resistance distance between any two vertices of a connected graph is defined as the net effective resistance between them in the electrical network constructed from the graph by replacing each edge with a unit resistor. In this article, using electric network approach and combinatorial approach, we derive exact expression for resistance distances between any two vertices of polyacene graphs.

Degree Kirchhoff Index of Bicyclic Graphs

2017 ◽  
Vol 60 (1) ◽  
pp. 197-205 ◽  
Author(s):  
Zikai Tang ◽  
Hanyuan Deng
Keyword(s):  
Connected Graph ◽  
Minimum Degree ◽  
Kirchhoff Index ◽  
Resistance Distance ◽  
Degree Of Vertex ◽  
Vertex Set ◽  
Maximum And Minimum Degree ◽  
Bicyclic Graphs

AbstractLet G be a connected graph with vertex set V(G).The degree Kirchhoò index of G is defined as S'(G) = Σ{u,v}⊆V(G) d(u)d(v)R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between vertices u and v. In this paper, we characterize the graphs having maximum and minimum degree Kirchhoò index among all n-vertex bicyclic graphs with exactly two cycles.

scholarly journals Strengthened Brooks' Theorem for Digraphs of Girth at least Three

10.37236/682 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Ararat Harutyunyan ◽  
Bojan Mohar
Keyword(s):  
Chromatic Number ◽  
Complete Graph ◽  
Connected Graph ◽  
Absolute Constant ◽  
Maximum Degree ◽  
Geometric Mean ◽  
Degree Of A Vertex ◽  
Odd Cycle ◽  
Directed Cycles

Brooks' Theorem states that a connected graph $G$ of maximum degree $\Delta$ has chromatic number at most $\Delta$, unless $G$ is an odd cycle or a complete graph. A result of Johansson shows that if $G$ is triangle-free, then the chromatic number drops to $O(\Delta / \log \Delta)$. In this paper, we derive a weak analog for the chromatic number of digraphs. We show that every (loopless) digraph $D$ without directed cycles of length two has chromatic number $\chi(D) \leq (1-e^{-13}) \tilde{\Delta}$, where $\tilde{\Delta}$ is the maximum geometric mean of the out-degree and in-degree of a vertex in $D$, when $\tilde{\Delta}$ is sufficiently large. As a corollary it is proved that there exists an absolute constant $\alpha < 1$ such that $\chi(D) \leq \alpha (\tilde{\Delta} + 1)$ for every $\tilde{\Delta} > 2$.

scholarly journals Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Muhammad Rizwan ◽  
Akhlaq Ahmad Bhatti ◽  
Muhammad Javaid ◽  
Ebenezer Bonyah
Keyword(s):  
Connected Graph ◽  
Perfect Matching ◽  
Matching Number ◽  
Bicyclic Graph ◽  
Bicyclic Graphs ◽  
Extremal Values

A connected graph G V , E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set such that the number of vertices is two times its matching number. In this paper, we investigated maximum and minimum values of variable sum exdeg index, SEI a for bicyclic graphs with perfect matching for k ≥ 5 and a > 1 .

Resistance Distances and Kirchhoff Index in Generalised Join Graphs

2017 ◽  
Vol 72 (3) ◽  
pp. 207-215 ◽  
Author(s):  
Haiyan Chen
Keyword(s):  
Complete Graph ◽  
Connected Graph ◽  
Effective Resistance ◽  
Electrical Network ◽  
Kirchhoff Index ◽  
Resistance Distance ◽  
Join Graph ◽  
Explicit Formulae

AbstractThe resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a unit resistor. The Kirchhoff index of a graph is defined as the sum of all the resistance distances between any pair of vertices of the graph. Let G=H[G1, G2, …, Gk ] be the generalised join graph of G1, G2, …, Gk determined by H. In this paper, we first give formulae for resistance distances and Kirchhoff index of G in terms of parameters of ${G'_i}s$ and H. Then, we show that computing resistance distances and Kirchhoff index of G can be decomposed into simpler ones. Finally, we obtain explicit formulae for resistance distances and Kirchhoff index of G when ${G'_i}s$ and H take some special graphs, such as the complete graph, the path, and the cycle.

scholarly journals Bicyclic graphs with maximum degree resistance distance

Filomat ◽  
2016 ◽  
Vol 30 (6) ◽  
pp. 1625-1632 ◽  
Author(s):  
Junfeng Du ◽  
Jianhua Tu
Keyword(s):  
Maximum Degree ◽  
Minimum Degree ◽  
Theoretical Chemistry ◽  
Graph Invariants ◽  
Resistance Distance ◽  
Unicyclic Graphs ◽  
Degree Of Vertex ◽  
Bicyclic Graphs

Graph invariants, based on the distances between the vertices of a graph, are widely used in theoretical chemistry. Recently, Gutman, Feng and Yu (Transactions on Combinatorics, 01 (2012) 27- 40) introduced the degree resistance distance of a graph G, which is defined as DR(G) = ?{u,v}?V(G)[dG(u)+dG(v)]RG(u,v), where dG(u) is the degree of vertex u of the graph G, and RG(u, v) denotes the resistance distance between the vertices u and v of the graph G. Further, they characterized n-vertex unicyclic graphs having minimum and second minimum degree resistance distance. In this paper, we characterize n-vertex bicyclic graphs having maximum degree resistance distance.

Sign in / Sign up

Export Citation Format

Share Document