Ioan Tomescu

According to our database, Ioan Tomescu authored at least 94 papers between 1970 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Extremal quasi-unicyclic graphs with respect to vertex-degree function index.

Ioan Tomescu

Electron. J. Graph Theory Appl., 2023

2022

Extremal vertex-degree function index for trees and unicyclic graphs with given independence number.

Ioan Tomescu

Discret. Appl. Math., 2022

Minimizing vertex-degree function index for k-generalized quasi-unicyclic graphs.

Ioan Tomescu

Art Discret. Appl. Math., 2022

2021

Unified extremal results for k-apex unicyclic graphs (trees).

Muhuo Liu, Ioan Tomescu, Jianping Liu

Discret. Appl. Math., 2021

2020

Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices.

Muhuo Liu, Kun Cheng, Ioan Tomescu

Discret. Appl. Math., 2020

2019

Proof of a conjecture concerning maximum general sum-connectivity index χα of graphs with given cyclomatic number when 1α2.

Ioan Tomescu

Discret. Appl. Math., 2019

Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices.

Faisal Javaid, Muhammad Kamran Jamil, Ioan Tomescu

Discret. Appl. Math., 2019

Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number.

Ioan Tomescu

Art Discret. Appl. Math., 2019

Bicyclic Connected Graphs Having Smallest Degree Distances.

Mihaita Dragan, Ioan Tomescu

Proceedings of the 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2019

2018

First Reformulated Zagreb Index And Some Graph Operations.

Muhammad Kamran Jamil, Ioan Tomescu

Ars Comb., 2018

2017

Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number.

Muhammad Kamran Jamil, Ioan Tomescu

Discret. Appl. Math., 2017

2016

On the general sum-connectivity index of connected graphs with given order and girth.

Ioan Tomescu

Electron. J. Graph Theory Appl., 2016

On metric dimension of convex polytopes with pendant edges.

Muhammad Imran, Syed Ahtsham Ul Haq Bokhary, Abdul Qudair Baig, Ioan Tomescu

Ars Comb., 2016

2015

Extremal Bicyclic 3-Chromatic Graphs.

Ioan Tomescu, Sana Javed

Graphs Comb., 2015

On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices.

Ioan Tomescu, Misbah Arshad

Discret. Appl. Math., 2015

General Sum-Connectivity Index with α ≥ 1 for Trees and Unicyclic Graphs with k Pendants.

Rozica-Maria Tache, Ioan Tomescu

Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

2014

Hypergraphs with pendant paths are not chromatically unique.

Ioan Tomescu

Discuss. Math. Graph Theory, 2014

Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index.

Ioan Tomescu, Salma Kanwal

Discret. Appl. Math., 2014

2-Connected graphs with minimum general sum-connectivity index.

Ioan Tomescu

Discret. Appl. Math., 2014

On Metric Dimension of Generalized Petersen Graphs P(n, 3).

Muhammad Imran, Abdul Qudair Baig, Muhammad Kashif Shafiq, Ioan Tomescu

Ars Comb., 2014

2013

On the Chromaticity of Quasi Linear Hypergraphs.

Ioan Tomescu, Sana Javed

Graphs Comb., 2013

2012

Some Results on Chromaticity of Quasi-Linear Paths and Cycles.

Ioan Tomescu

Electron. J. Comb., 2012

On The Cyclomatic Number Of Linear Hypergraphs.

Ioan Tomescu, Akhlaq Ahmad Bhatti

Ars Comb., 2012

Multi-level distance labelings for helm graphs.

M. Tariq Rahim, Ioan Tomescu

Ars Comb., 2012

On the Connected Partition Dimension of a Wheel Related Graph.

Ioan Tomescu

Proceedings of the Computation, Physics and Beyond, 2012

2011

Metric Dimension and <i>R</i>-Sets of Connected Graphs.

Ioan Tomescu, Muhammad Imran

Graphs Comb., 2011

Magic graphs with pendant edges.

Ngurah Anak Agung Gede, Edy Tri Baskoro, Ioan Tomescu

Ars Comb., 2011

2010

Series-parallel chromatic hypergraphs.

Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary

Discret. Appl. Math., 2010

Ordering connected graphs having small degree distances.

Ioan Tomescu

Discret. Appl. Math., 2010

2009

From rankings' collinearity to counting SDR's via chromatic list expression.

Liviu Petrisor Dinu, Ioan Tomescu

Int. J. Comput. Math., 2009

Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs.

Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary

Graphs Comb., 2009

On the Chromaticity of Multi-Bridge Hypergraphs.

Syed Ahtsham Ul Haq Bokhary, Ioan Tomescu, Akhlaq Ahmad Bhatti

Graphs Comb., 2009

Properties of connected graphs having minimum degree distance.

Ioan Tomescu

Discret. Math., 2009

2008

Threshold Properties of Some Periodic Factors of Words over a Finite Alphabet.

Ioan Tomescu

J. Autom. Lang. Comb., 2008

The Ramsey Numbers of Large cycles Versus Odd Wheels.

Surahmat, Edy Tri Baskoro, Ioan Tomescu

Graphs Comb., 2008

Discrepancies between metric dimension and partition dimension of a connected graph.

Ioan Tomescu

Discret. Math., 2008

2007

On the chromaticity of sunflower hypergraphs SH(n, p, h).

Ioan Tomescu

Discret. Math., 2007

On the number of words containing the factor (aba)^k.

Ioan Tomescu

Discret. Appl. Math., 2007

On the partition dimension and connected partition dimension of wheels.

Ioan Tomescu, Imran Javaid, Slamin

Ars Comb., 2007

2006

A characterization of the words occurring as factors in a minimum number of words.

Ioan Tomescu

Theor. Comput. Sci., 2006

The Ramsey numbers of large cycles versus wheels.

Surahmat, Edy Tri Baskoro, Ioan Tomescu

Discret. Math., 2006

2005

Asymptotic Properties of the Factors of Words Over a Finite Alphabet.

Ioan Tomescu

Fundam. Informaticae, 2005

Almost all graphs and h-hypergraphs have small diameter.

Ioan Tomescu

Australas. J Comb., 2005

2004

Sunflower hypergraphs are chromatically unique.

Ioan Tomescu

Discret. Math., 2004

2003

On the number of occurrences of all short factors in almost all words.

Ioan Tomescu

Theor. Comput. Sci., 2003

Maximal σ-polynomials of connected 3-chromatic graphs.

Ioan Tomescu

J. Graph Theory, 2003

2002

On the number of h-connected graphs with a fixed diameter.

Ioan Tomescu

Discret. Math., 2002

Irreducible Coverings by Cliques and Sperner's Theorem.

Ioan Tomescu

Electron. J. Comb., 2002

On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques.

Ioan Tomescu

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

On the number of graphs and h-hypergraphs with bounded diameter.

Ioan Tomescu

Discret. Math., 2001

The number of h-strongly connected digraphs with small diameter.

Ioan Tomescu

Australas. J Comb., 2001

The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity.

Ioan Tomescu

Proceedings of the Combinatorics, 2001

2000

Complex Roots of a Polynomial: 10688.

Ioan Tomescu, Kee-Wai Lau, O. P. Lossers, Kenneth F. Andersen, Robin J. Chapman, Óscar Ciaurri, E. Fernandez, Valerio De Angelis, Emeric Deutsch, G. Will, M. Falkowitz, Zachary Franco, C. Georghiou, J. Lewandowski, Albert Nijenhuis, Timothy S. Norfolk, Allen Stenger

Am. Math. Mon., 2000

On the number of large h-hypergraphs with a fixed diameter.

Ioan Tomescu

Discret. Math., 2000

1999

Some Extremal Properties of the Degree Distance of a Graph.

Ioan Tomescu

Discret. Appl. Math., 1999

1998

On Words Containing all Short Subwords.

Ioan Tomescu

Theor. Comput. Sci., 1998

Chromatic Coefficients of Linear Uniform Hypergraphs.

Ioan Tomescu

J. Comb. Theory B, 1998

A Threshold Property Concerning Words Containing All Short Factors.

Ioan Tomescu

Bull. EATCS, 1998

1997

Optimum Huffman Forests.

Ioan Tomescu

J. Univers. Comput. Sci., 1997

Optimum Extendible Prefix Codes.

Cristian Calude, Ioan Tomescu

J. Univers. Comput. Sci., 1997

On the number of trees having k edges in common with a graph of bounded degrees.

Ioan Tomescu

Discret. Math., 1997

Maximum chromatic polynomial of 3-chromatic blocks.

Ioan Tomescu

Discret. Math., 1997

1996

On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet.

Ioan Tomescu

Theor. Comput. Sci., 1996

Bonferroni Inequalities and Negative Cycles in Large Complete Signed Graphs.

Dragos Radu Popescu, Ioan Tomescu

Eur. J. Comb., 1996

On the number of irreducible coverings by edges of complete bipartite graphs.

Ioan Tomescu

Discret. Math., 1996

An asymptotic formula for the number of graphs having small diameter.

Ioan Tomescu

Discret. Math., 1996

Negative Cycles in Complete Signed Graphs.

Dragos Radu Popescu, Ioan Tomescu

Discret. Appl. Math., 1996

The number of digraphs with small diameter.

Ioan Tomescu

Australas. J Comb., 1996

1994

On the Number of Subtrees for Almost All Graphs.

Ioan Tomescu

Random Struct. Algorithms, 1994

Maximum chromatic polynomials of 2-connected graphs.

Ioan Tomescu

J. Graph Theory, 1994

Minimum Spanning Hypertrees.

Ioan Tomescu, Marius Zimand

Discret. Appl. Math., 1994

1992

Ordered h-hypertrees.

Ioan Tomescu

Discret. Math., 1992

1990

Maximal chromatic polynomials of connected planar graphs.

Ioan Tomescu

J. Graph Theory, 1990

Almost all digraphs have a kernel.

Ioan Tomescu

Discret. Math., 1990

1988

Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons.

Alexandru T. Balaban, Ioan Tomescu

Discret. Appl. Math., 1988

1987

On 3-colorings of bipartite <i>p</i>-threshold graphs.

Ioan Tomescu

J. Graph Theory, 1987

Graphical Eulerian numbers and chromatic generating functions.

Ioan Tomescu

Discret. Math., 1987

1986

Hypertrees and Bonferroni inequalities.

Ioan Tomescu

J. Comb. Theory B, 1986

On the number of paths and cycles for almost all graphs and digraphs.

Ioan Tomescu

Comb., 1986

1984

Digital metrics: A graph-theoretical approach.

Frank Harary, Robert A. Melter, Ioan Tomescu

Pattern Recognit. Lett., 1984

Metric bases in digital geometry.

Robert A. Melter, Ioan Tomescu

Comput. Vis. Graph. Image Process., 1984

1983

Path generated digital metrics.

Robert A. Melter, Ioan Tomescu

Pattern Recognit. Lett., 1983

On Hamiltonian-connected regular graphs.

Ioan Tomescu

J. Graph Theory, 1983

1982

Boolean distance for graphs.

Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu

Discret. Math., 1982

1981

Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets.

Ioan Tomescu

Discret. Math., 1981

1980

Some properties of irreducible coverings by cliques of complete multipartite graphs.

Ioan Tomescu

J. Comb. Theory B, 1980

1979

Le nombre minimal de colorations d'un hypergraphe k-chromatique.

Ioan Tomescu

Discret. Math., 1979

1976

Le nombre maximal de colorations d'un graphe hamiltonien.

Ioan Tomescu

Discret. Math., 1976

1974

La reduction minimale d'un graphe a une reunion de cliques.

Ioan Tomescu

Discret. Math., 1974

1973

A Combinatorial Algorithm for Solving Covering Problems.

Ioan Tomescu

IEEE Trans. Computers, 1973

1972

A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine.

Ioan Tomescu

IEEE Trans. Computers, 1972

A Method for Minimizing the Number of States for a Restricted Class of Incompletely Specified Sequential Machines.

Ioan Tomescu

Math. Syst. Theory, 1972

Le nombre maximal de 3-colorations d'un graphe connexe.

Ioan Tomescu

Discret. Math., 1972

1970

A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network.

Ioan Tomescu

IEEE Trans. Computers, 1970