Structural properties of subdivided-line graphs

DOI10.1016/J.JDA.2015.01.008zbMATH Open1325.05139OpenAlexW2044393195MaRDI QIDQ2018541FDOQ2018541

Toru Hasunuma

Publication date: 24 March 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2015.01.008

Recommendations

• Structural properties of subdivided-line graphs
• scientific article; zbMATH DE number 4033797
• Hamiltonian paths in spanning subgraphs of line graphs
• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
• Connectivity and some other properties of generalized Sierpiński graphs

zbMATH Keywords

edge-disjoint Hamilton cyclesbook embeddingindependent spanning treesconnected dominating setcompletely independent spanning trees[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Sierpi%EF%BF%BD%EF%BF%BDski+graph&go=Go Sierpi��ski graph]hub setHamiltonian-connectivitysubdivided line graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• The average eccentricity of Sierpiński graphs
• Global strong defensive alliances of Sierpiński-like graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Crossing numbers of Sierpiński‐like graphs
• The hub number of Sierpiński-like graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Line Digraph Iterations and the (d, k) Digraph Problem
• Disjoint Hamiltonian cycles in recursive circulant graphs
• Disjoint Hamilton cycles in the star graph
• The book thickness of a graph
• The multi-tree approach to reliability in distributed networks
• Embedding planar graphs in four pages
• Independent spanning trees of chordal rings
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• The pagenumber of the class of bandwidth-k graphs is \(k-1\)
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• Title not available (Why is that?)
• The hub number of a graph
• Two counterexamples on completely independent spanning trees
• Title not available (Why is that?)
• Completely independent spanning trees in torus networks
• Completely independent spanning trees in the underlying graph of a line digraph
• Independent spanning trees with small depths in iterated line digraphs
• Edge-disjoint Hamilton cycles in graphs
• Coloring Hanoi and Sierpiński graphs
• Title not available (Why is that?)
• Independent trees in planar graphs
• Pagenumber of complete bipartite graphs
• Independent Spanning Trees on Multidimensional Torus Networks
• Finding Four Independent Trees
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• Shortest paths in Sierpiński graphs
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• Embedding iterated line digraphs in books
• Genus g Graphs Have Pagenumber O(√g)
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• The linear \(t\)-colorings of Sierpiński-like graphs
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• New results on variants of covering codes in Sierpiński graphs
• The pagenumber of \(k\)-trees is \(O(k)\)
• Optimal book embeddings of the FFT, Benes, and barrel shifter networks
• The connected hub number and the connected domination number
• Improved book-embeddings of incomplete hypercubes
• Embedding de Bruijn, Kautz and shuffle-exchange networks in books
• Title not available (Why is that?)

Cited In (13)

• Completely independent spanning trees in line graphs
• A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
• A survey and classification of Sierpiński-type graphs
• COHERENCE ANALYSIS FOR ITERATED LINE GRAPHS OF MULTI-SUBDIVISION GRAPH
• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
• Integrity of total transformation graphs
• Constructions of universalized Sierpiński graphs based on labeling manipulations
• Title not available (Why is that?)
• Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures
• On topological properties of the line graphs of subdivision graphs of certain nanostructures
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Structural properties of the line-graphs associated to directed networks
• Maximum matchings in scale-free networks with identical degree distribution

This page was built for publication: Structural properties of subdivided-line graphs

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