Traversability and connectivity of the middle graph of a graph

Cites work

Connectivity, line-connectivity and J-conntection of the total graph
On Eulerian and Hamiltonian Graphs and Line Graphs
On the connectivity of total graphs
On the line-connectivity of line-graphs
Parallel concepts in graph theory
The connectivity of line-graphs
The connectivity of total graphs
Total Graphs and Traversability

Cited in

(38)

Solutions of some further graph equations
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests
On edge-rupture degree of graphs
Bartholdi zeta functions of line graphs and middle graphs of graph coverings
Domination-complete graphs
On the independence number in \(K_{1,r+1}\)-free graphs
Infinite \(\Phi\)-periodic graphs
Minimum degree energy of graphs
scientific article; zbMATH DE number 4214057 (Why is no real title available?)
Zeta functions and complexities of middle graphs of semiregular bipartite graphs
Graph equations involving tensor product of graphs
Middle domination and 2-independence in trees
The dominated chromatic number of middle graphs
Domination number of middle graphs
Perfect Roman domination in middle graphs
Total domination number of middle graphs
On mixed metric dimension in subdivision, middle, and total graphs
On the D-differential of a graph
On the set chromatic number of the middle graph of extended stars and related tree families
Total dominator coloring number of middle graphs
Italian, 2-rainbow and Roman domination numbers in middle graphs
Domination-related parameters in middle graphs
Sigma chromatic number of the middle graph of some general families of trees of height 2
Distinguishing chromatic number of middle and subdivision graphs
Incident vertex pi coloring of middle, total, line and splitting graph for star and double star graph families
Minimizing distances between vertices and edges through tree t-spanners
Minimizing distances between vertices and edges through tree \(t\)-spanners
Strong defensive alliances on graph operators
On the non-incident quasi-total graph and its complement
On a construction using commuting regular graphs
Identifying code number of some of the middle graphs
On the outer-independent total (Roman) domination number of some graph operators
On a class of graphs with equal identifying code number and independence number
On domination and independent domination numbers of a graph
An algorithm to recognize a middle graph
Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs
Zeta functions of line, middle, total graphs of a graph and their coverings
Hamiltonicity of complements of middle graphs

This page was built for publication: Traversability and connectivity of the middle graph of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1222659)