Results 261 to 270 of about 258,952 (290)
On the edge-tenacity of the middle graph of a graph [PDF]
International Journal of Computer Mathematics, 2005 We consider the problem of efficiently breaking a graph into small components by removing edges. One measure of how easily this can be done is the edge-tenacity. Given a set of edges of G, the score of S is defined as sc(S)=[| S|+τ (G−S)]/[w(G−S)]. Formally, the edge-tenacity of a graph G is defined as T′(G)=min sc(S), where the minimum is taken over ...
Aysun Aytaç
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Prism Over the Middle-levels Graph is Hamiltonian
Order, 2005Let \textbf{B}\(_k\) be the bipartite graph whose vertices are subsets of size \(k\) or \(k+1\) of the set \(\{1,2,\dots,2k+1\}\), and whose edges represent the inclusion between two such subsets. The authors prove that the prism over \textbf{B}\(_k\) is Hamiltonian and that \textbf{B}\(_k\) has a closed spanning 2-trail.
Zdenek Ryjáček +2 more
exaly +2 more sources
Zeta functions of line, middle, total graphs of a graph and their coverings [PDF]
Linear Algebra and Its Applications, 2006 We consider the (Ihara) zeta functions of line graphs, middle graphs and total graphs of a regular graph and their (regular or irregular) covering graphs. Let L(G), M(G) and T(G) denote the line, middle and total graph of G, respectively.
Jin Ho Kwak
exaly +4 more sources
A Note on the Integrity of Middle Graphs
2007The integrity I(G) of a noncomplete connected graph G is a measure of network invulnerability and is defined by I(G) = min{|S + m(G - S)}, where S and m(G - S) denote the the subset of V and the order of the largest component of G - S, respectively. In this paper, we determine the integrity and some other parameters of middle graphs of some classes of ...
Aygul Mamut, Elkin Vumar
openaire +1 more source
Domination-related parameters in middle graphs
Discrete Mathematics, Algorithms and Applications, 2023The middle graph [Formula: see text] of a graph [Formula: see text] is the graph obtained by subdividing each edge of [Formula: see text] exactly once and joining all these newly introduced vertices of adjacent edges of [Formula: see text]. It is known that the decision problems for Italian domination number [Formula: see text], [Formula: see text ...
openaire +2 more sources
The dominated chromatic number of middle graphs
The Art of Discrete and Applied Mathematics, 2022Summary: A dominated coloring of a graph is a proper vertex coloring such that every color class is dominated with at least one vertex. The minimum number of colors needed for a dominated coloring of a graph \(G\) is the dominated chromatic number of \(G\). The middle graph \(M(G)\) of a graph \(G\) is the graph obtained by subdividing each edge of \(G\
openaire +2 more sources
On the nullity of middle graphs
Linear Algebra and its ApplicationsThe nullity of a graph is the multiplicity of \(0\) as an eigenvalue of its adjacency matrix. Classifying connected graphs with a given nullity is a difficult problem. \textit{I. Gutman} and \textit{I. Sciriha} [Discrete Math. 232, No. 1--3, 35--45 (2001; Zbl 0971.05070)] showed that, although the nullity of connected line graphs is unbounded, the case
Xinmei Yuan, Danyi Li, Weigen Yan
openaire +1 more source
On the toughness of the middle graph of a graph.
Ars Comb., 2001The middle graph \(M(G)\) of a graph is the graph obtained from \(G\) by inserting a new vertex into every edge of \(G\) and by joining by edges those pairs of these new vertices which lie on adjacent edges of \(G\). Let \(\omega (G-S)\) be the number of connected components of the graph \(G-S\) obtained from a graph \(G\) by deleting a subset \(S\) of
openaire +1 more source
On the number of perfect matchings of middle graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jingchao Lai, Weigen Yan, Xing Feng
openaire +1 more source