connected graphs
Reducing CMSO model checking to highly connected graphs
... highly connected graphs”, then CMSO [ψ] is solvable in polynomial time (on general ...a connected induced subgraph of G such that “few” vertices in this subgraph have neighbors outside the subgraph, ...
14
On the atom bond connectivity index and radius of connected graphs
... As an immediate application of Lemma , we know that the complete graph is the unique graph with maximum ABC index among connected graphs. Furthermore, we can deduce that the upper bound of ABC(G) – r(G) ...
8
The maximal total irregularity of some connected graphs
... The theory of majorization as a powerful tool has widely been applied to the related research areas of pure and the applied mathematics [12]. Recently some issues related to the structural properties of graphs ...
8
The sharp bounds on general sum connectivity index of four operations on graphs
... unicyclic graphs, -connected graphs and bicyclic graphs were given in ...these graphs S(G), R(G), Q(G), and T (G), in terms of W (F(G)) and W ...
10
The flip Markov chain for connected regular graphs
... to connected graphs, and no flip can disconnect a connected ...a connected graph, the set of available flips may be strictly smaller than the set of available ...
41
Probabilistic analysis of highly connected random geometric graphs
... their previous work is extended to k-edge-connectivity. Mahjoub [23] studied the polytope of all 2-vertex-connected graphs and derived some useful results on the extreme points of this polytope. ...
60
The matching energy of graphs with given edge connectivity
... extremal graphs with respect to matching energy among some classes of connected graphs with n ...extremal graphs in connected unicyclic, bicyclic graphs were determined in [] ...
9
Graphs with smallest forgotten index
... All graphs considered are assumed to be simple and ...with connected graphs, for which = 1. A connected graph with = 0 is said to be a ...tree. Graphs with = 1, 2, 3, 4, 5 are then ...
15
Polynomial-Delay Enumeration of Monotonic Graph Classes
... listing graphs that makes sure that no two equivalent graphs are being ...of graphs to enumerate, this algorithm is correct and achieves polynomial ...of graphs that can be enumerated with low ...
23
On Harmonic Index and Diameter of Unicyclic Graphs
... simple connected graphs, trees and unicyclic graphs and characterized the corresponding extremal ...special graphs namely ladder graph, prism graph and book ...
8
Graphs that do not contain a cycle with a node that has at least two neighbors on it
... of graphs closed under taking subgraphs, such as being k-colorable, is false for critically 2-connected graphs, unless it holds for all ...chordless graphs, and in this paper we consider ...
23
PLATT NUMBER OF TOTAL GRAPHS
... In this paper, the concept of Platt number is analysed in certain classes of graphs and their total graphs. Bounds on the Platt numbers of connected graphs are proposed. The focus of further ...
10
The Upper Monophonic Hull Number of a Graph
... a connected graph G = (V,E), the monophonic hull number mh(G) of a graph G is the minimum cardinality of a set of vertices whose monophonic convex hull contains all vertices of ...a connected graph G is ...
5
Upper and lower bounds of symmetric division deg index
... extremal graphs obtained with the help of MathChem [10] have particularly simple and elegant ...extremal graphs of the SDD index in several classes of graphs (with given number of vertices): the ...
8
THE RHETORIC OF REFUGEES: LITERACY, NARRATIVE AND IDENTITY FOR SOMALI WOMEN
... class of graphs closely related to HITs and HISTs. A Halin graph is obtained from a plane embedding of a HIT of at least 4 vertices by connecting its leaves into a cycle following the cyclic order determined by ...
184
Solving computational problems in the theory of word representable graphs
... for graphs on at most 9 ...count connected non-word-representable ...all connected graphs on 11 vertices are ...of connected non- word-representable graphs on 9 vertices (see ...
18
Finite BCI-groups are solvable
... All graphs considered here are assumed to be undirected, finite and simple unless stated otherwise. For a graph Γ, we use V (Γ), E(Γ), and Aut(Γ) to denote the vertex set, the edge set and the full automorphism ...
6
The Hamiltonian Connected Property of Some Shaped Supergrid Graphs
... grid graphs contain grid graphs as ...grid graphs defined above are isomorphic to the original triangular grid graphs studied in the literature [7] but these graphs are different when ...
6
Characterization Of 1-Uniform Dcsl Labeling Of Product Graphs
... THROUGHOUT this article by a graph means a connected, finite, simple graph. Exclusively for all the terms in Graph theory, the scholar is recommended to ,4- and ,5-. Prof. Acharya ,1- established the concept of ...
5
The von Neumann entropy of networks
... consider graphs with only six vertices, it is al- ready evident that long paths, nontrivial symmetries and connected components give rise to a larger increase of the ...
6