Results 261 to 270 of about 2,773,301 (295)
MISCELLANEOUS PROPERTIES OF MIDDLE GRAPHS
MISCELLANEOUS PROPERTIES OF MIDDLE GRAPHSopenaire +1 more source
Hamiltonicity of Complements of Middle Graphs
Discrete Mathematics, 2007 Let \(G(V,E)\) be an undirected finite simple graph. The middle graph \(M(G)\) of \(G\) has the vertex set \(V(G)\cup E(G)\) and two vertices \(x,y\) of \(M(G)\) are adjacent in \(M(G)\) if at least one of them corresponds to an edge \(e\) of \(G\) and the other one is either one of the endvertices of \(e\) in \(G\), or corresponds to an edge \(f\) of \
Xinhui An, Baoyindureng Wu
exaly +3 more sources
On the Bondage Number of Middle Graphs
Mathematical Notes, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aytac, A., Turaci, T., Odabas, Z. N.
exaly +5 more sources
Radio Number for Middle Graph of Paths [PDF]
Electronic Notes in Discrete Mathematics, 2017 8 Pages, CTGTC 2016 conference proceedings ...
Devsi Bantva
exaly +4 more sources
Enumeration of Spanning Trees of Middle Graphs [PDF]
Applied Mathematics and Computation, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weigen Yan
exaly +4 more sources
Zeta Functions and Complexities of Middle Graphs of Semiregular Bipartite Graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iwao Sato
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the edge-tenacity of the middle graph of a graph
International Journal of Computer Mathematics, 2005We 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 ...
openaire +3 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 +2 more sources
On the Number of Perfect Matchings of Middle Graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xing Feng, Weigen Yan, Jingchao Lai
exaly +2 more sources
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 +3 more sources