Structural properties of twin-free graphs

MaRDI QIDQ870075zbMATH OpenFDO

Authors Irène Charon, Olivier Hudry, Iiro Honkala, Antoine Lobstein

Publication date 12 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127478, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r16.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Combinatorial codes (94B25)

Recommendations

• Induced paths in twin-free graphs
• On the number of optimal identifying codes in a twin-free graph
• Extremal values for identification, domination and maximum cliques in twin-free graphs.
• Minimum sizes of identifying codes in graphs differing by one vertex
• Minimum sizes of identifying codes in graphs differing by one edge

Cited in

(23)

• Locating-domination and identification
• Extremal values for identification, domination and maximum cliques in twin-free graphs.
• Extremal graphs for the identifying code problem
• On the ensemble of optimal identifying codes in a twin-free graph
• Extremal values for the maximum degree in a twin-free graph.
• On the size of identifying codes in triangle-free graphs
• Twin subgraphs and core-semiperiphery-periphery structures
• Identifying path covers in graphs
• On Iiro Honkala's contributions to identifying codes
• On cages admitting identifying codes
• On the size of identifying codes in binary hypercubes
• Minimum sizes of identifying codes in graphs differing by one edge
• Twins in graphs
• Induced paths in twin-free graphs
• Some classifications of graphs with respect to a set adjacency relation
• The minimum number of maximal independent sets in twin-free graphs
• On \(r\)-locating-dominating sets in paths
• On the number of optimal identifying codes in a twin-free graph
• Minimum sizes of identifying codes in graphs differing by one vertex
• Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
• Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
• The difference between the metric dimension and the determining number of a graph
• Characterization theorems for the spaces of derivations of evolution algebras associated to graphs

This page was built for publication: Structural properties of twin-free graphs

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